Filter apparatus, reception apparatus, transmission apparatus, diffusion modulation apparatus, pseudo-random number sequence output apparatus, filter method, reception method, transmission method, diffusion modulation method, pseudo-random number sequence output method, and program

ABSTRACT

A filter ( 201 ) accepts spreading code sequences or the like as input sequences of a chip rate 1/D, the accepted spreading code sequences are sequentially delayed and distributed by delay circuits ( 202 ) connected in series, delay times of individual signals are an arithmetical progression with a chip length D being a common difference D, the individual signals are amplified with spreading codes by amplifiers ( 203 ), amplification factors for the individual signals are a geometrical progression of a common ratio r, the sum of the amplified signals is obtained by addition in an adder ( 204 ), and the result is sequentially output as an output sequence.

TECHNICAL FIELD

[0001] The present invention relates to a filter apparatus, a receiving apparatus, a transmitting apparatus, a spread modulation apparatus, a pseudorandom sequence output apparatus, a filter method, a receiving method, a transmitting method, a spread modulation method, a pseudorandom sequence output method and a program which realizes them on a computer.

[0002] Those subject matters are suitable for realizing a filtering process effective in an asynchronous CDMA (Code Division Multiple Access) of a spectrum spread communication, which can be used in a distance measuring field, as well as, for example, satellite communication, fixed-line communication, portable phone and PHS (Personal Handyphone System), and acquiring a pseudorandom sequence which can be used as spreading codes.

BACKGROUND ART

[0003] Conventionally, there have been proposed an M-sequence, Kasami-codes, a Gold sequence or the like which are generated by a linear feedback shift register (LFSR) as spreading codes which realize spectrum spread communication and code division multiplex communication. Those spreading code sequences have the following two features.

[0004] First, there is a single peak in the correlation (autocorrelation) between same codes and the correlation (cross-correlation) between different codes is 0. This is extremely analogous to the property of white noise.

[0005] Secondly, in case where two different spreading codes included in a set of codes are selected and in case where a code set is constructed in such a way that if either one is selected, the cross-correlation comes closer to 0, the number of codes included in the code set is merely 0(N) with respect to a code length N. Therefore, there are few kinds of codes.

[0006] Meanwhile, there have also been known TDMA (Time Division Multiple Access) and FDMA (Frequency Division Multiple Access). Unlike those, the asynchronous CDMA communication system has a feature that decoding is possible by using the correlation characteristics of codes to be used without positively taking synchronism of signals. Therefore, it is excellent in security, confidentiality, anti-interference, disturbance and so forth.

[0007] At present, the asynchronous CDMA communication system is undergoing the practical use stage and its use has been decided as the ITU (International Telecommunication Union) standard for wireless communication of the next generation called IMT-2000 (International Mobile Telecommunication 2000).

[0008] It is known from the recent studies that in the asynchronous CDMA communication system, the variance σ of intersymbol interference noise determines the performance of the system. It is disclosed in, for example, the following document that in case where pseudo white noise, such as a Gold-code or Kasami-code, is used as a spreading code, the variance a is asymptotically

σ=(K−1)/3N

[0009] where K is the number of simultaneously connected users and N is the code length.

[0010] M. B. Pursley, “Performance Evaluation for Phased-Coded Spread-Spectrum Multiple-Access Communication-Part I: System Analysis” (IEEE Trans. Communications, vol. 25 (1977) pp. 795-799.)

[0011] Here, “asymptotically” means a case where the user number K and the code length N taken are large.

[0012] Conventionally, the theoretical limit of the performance of the asynchronous CDMA communication system was considered to be this σ=(K−1)/3N. However, it was also known that satisfying such an asymptotical relationship was originated from spreading codes being pseudo white noise.

[0013] In case where spreading codes are not pseudo white noise, i.e., in case where there is some correlation between different codes, however, the theoretical limit of the performance may be improved.

[0014] Recently has been discovered the existence of spreading codes which have an autocorrelation function such that the variance a of intersymbol interference noise is reduced as compared with σ case where spreading codes are pseudo white noise. That is, in case where an autocorrelation function C(s) decreases exponentially as follows with respect to a code shift amount s

C(s)≅Const.×(−r)^(−s)(0<r<1),

[0015] the variance σ of intersymbol interference noise becomes smaller than that in the case of pseudo white noise.

[0016] In case where a real impulse constant r satisfies

r=2−3^(1/2),

[0017] particularly, it takes the form of the following optimal correlation function

σ_(optional)=3^(1/2)(K−1)/(6N).

[0018] This means that the number of simultaneously connected users, K, at the same bit error rate is increased by 15% from the theoretical limit of the user number of the asynchronous CDMA communication system when pseudo white noise is used as a spreading code. This point is disclosed in the following document.

[0019] G. Mazzini, R. Rovatti, and G. Setti “Interference Minimization by Auto-Correlation Shaping in Asynchronous DS-CDMA Systems: Chaos-Based Spreading is Nearly Optimal” (Electron. Lett. (1999) vol. 35, pp. 1054-1055)

[0020] The document illustrates that a correlation function C(s) which satisfies the above condition can be approximately typified by constructing chaos-based spreading codes using a piecewise linear map whose partial slope is extremely large.

[0021] To actually generate such a spreading sequence using a DSP (Digital Signal Processor) or the like and use in a portable phone or the like, however, high speed and low consumed power are needed, so that the following problems would arise.

[0022] First, there was a problem that as spreading codes were composed of a piecewise linear map whose partial slope is extremely large, executing computation by a DSP or computer or the like increased digit drop so that accurate results could not be obtained. This has brought about a matter that it is difficult to generate spreading codes in physical circuits or devices.

[0023] Secondly, there was a problem that a parameter which determines the manner of attenuation of a correlation function could not be adjusted freely with respect to an arbitrary r(−1<r<1).

[0024] Thirdly, the aforementioned document shows that there are few types of piecewise linear maps having correlation functions close to the optimal correlation function. To realize a CDMA communication system, however, it is better to provide as many kinds of codes as possible. Therefore, the use of the scheme disclosed in the aforementioned document made it difficult to actually construct a CDMA communication system.

[0025] Fourthly, with spreading codes generated by using a linear shift register, the types of codes with a good correlation characteristic with respect to the code length N are merely 0(N). This is very small whereas the proper types of codes should be a number 0(2^(N)) proportional to the power of 2. It is therefore difficult to cope with an increase in the number of users.

[0026] Fifthly, as the key space is narrow, there is less work needed for decoding. This raises a problem that the communication security becomes weaker.

[0027] The technique disclosed in the aforementioned document has not improvements made on those problems.

[0028] Therefore, there is a strong demand for a technique of generating spreading codes composed of a pseudorandom sequence (also called PN (Pseudo Noise) sequence) suitable for an asynchronous CDMA communication system while overcoming those problems.

[0029] There has been proposed a wireless communication technique by a system, such as the IMT-2000 W-CDMA system, 1CDMA 2000 system, Wireless LAN IEEE 802.1 lb or the like. As such wireless communication uses the same frequency band for plural communication connections, CDMA (Code Division Multiple Access) is utilized.

[0030] In the CDMA, plural communication connections can be put in the same frequency band or a desired communication connection can be separated from the same frequency band by spread-modulating communication information using different spreading codes.

[0031] Meanwhile, in those wireless communications, it is typical to transform information to be transferred into a complex number sequence, then perform a process.

[0032] Therefore, there is a demand for a simple technique for performing spread modulation using spreading codes which has an excellent separability in such a wireless communication technology.

[0033] Further, there has been proposed a spectrum spreading technique which uses, as spreading codes, an orthogonal code sequence (including an M-sequence, Gold-codes, an orthogonal code sequence acquired from a Walsh function, an orthogonal code sequence acquired from a Chebyshev's polynomial, a Baker sequence and a Manchester-coded orthogonal sequence; the same applied hereinafter).

[0034] As the same frequency band is used in plural communication connections in a wireless communication technique using systems, for example, the IMT-2000 W-CDMA system, 1CDMA 2000 system and Wireless LAN IEEE 802.11b, CDMA (Code Division Multiple Access) is used.

[0035] In the CDMA, a complex number in which elements of an orthogonal code sequence are placed in a real portion and an imaginary portion is a spreading code and plural communication connections can be put in the same frequency band or a desired communication connection can be separated from the same frequency band by spread-modulating communication information using different spreading codes.

[0036] In such a wireless communication technique, communication often takes place between a base station and a mobile terminal, but generally, first, a mobile terminal sends a signal to a base station (Up Link communication) and the base station receives it and takes synchronization, then communication is performed between both.

[0037] At the time of starting communication between both, therefore, synchronization is taken by getting a correlation on the then receiver side (which is generally the base station but may be the mobile terminal in some case).

[0038] Meanwhile, communication after synchronization (Down Link communication) has only to perform synchronization detection because synchronization has been taken beforehand.

[0039] In such a wireless communication technique, there is always a demand for a communication technique which has an excellent separability and has a low BER (Bit Error Rate) even if users are increased.

[0040] Further, there are large demands for an apparatus and devices that can perform a filter process which is used in a general-purpose fashion at the time of solving those problems. It is deemed that such a filter process has a wide range of application of to other fields.

[0041] The present invention aims at providing a filter apparatus, a receiving apparatus, a transmitting apparatus, a pseudorandom sequence output apparatus, a filter method, a receiving method, a transmitting method and a pseudorandom sequence output method, which are suitable in such various usages, and a program which realizes them on a computer.

DISCLOSURE OF INVENTION

[0042] To achieve the object, the following subject matters will be disclosed based on the principle of the invention.

[0043] A filter apparatus according to the first aspect of the invention is a filter apparatus for a predetermined real impulse constant r(−1<r<1), a predetermined real number constant x (x≠0), a predetermined delay time constant D and a predetermined positive integer M (M>1), has an input terminal, a delay amplification section, an adding section and an output terminal, and is constructed as follows.

[0044] That is, the input terminal accepts inputting of an input signal.

[0045] Meanwhile, the delay amplification section outputs M signals that are the input-accepted input signal delay-amplified with a delay time to and an amplification factor a₀, with a delay time t₁ and an amplification factor a₁, . . . , and with a delay time t_(M−1) and an amplification factor a_(M−1), respectively.

[0046] Further, the adding section outputs a sum of the delay-amplified and output M signals.

[0047] And, the output terminal outputs the added and output signal.

[0048] Meanwhile, t₀, t₁, . . . , t_(M−1) is an arithmetical progression of a common difference D.

[0049] Further, a₀, a₁, . . . , a_(M−1), is a geometrical progression of a common ratio −r or −1/r.

[0050] The following are typical combinations of such delay times and amplification factors.

[0051] (1) For t₀=0, t₁=D, . . . , t_(M−1)=(M−1)D, a₀=(−r)^(M−0)=(−r)^(M), a₁=(−r)^(M−1)=(−r)^(M−1), . . . , a_(M−1)=(−r)^(M−(M−1))=(−r)¹.

[0052] (2) For t₀=D, t₁=2D, . . . , t_(M−1)=MD, a₀=(−r)^(M−0)=(−r)^(M), a₁=(−r)^(M−1)=(−r)^(M−1), . . . , a_(M−1)=(−r)^(M−(M−1))=(−r)¹.

[0053] (3) For t₀=0, t₁=D, . . . , t_(M−1)=(M−1)D, a₀=(−r)¹⁺⁰=(−r)¹, a₁=(−r)¹⁺¹=(−r)², . . . , a_(M−1)=(−r)^(1+(M−1))=(−r)^(M).

[0054] (4) For t₀=D, t₁=2D, . . . , t_(M−1)=MD, a₀=(−r)¹⁺⁰=(−r)¹, a₁=(−r)¹⁺¹=(−r)², . . . , a_(M−1)=(−r)^(1+(M−1))=(−r)^(M).

[0055] Further, in the filter apparatus of the invention, the delay amplification section has a delay section and an amplification section and be constructed as follows.

[0056] That is, the delay section outputs M signals that are the input-accepted input signal delayed with delay times t₀, t₁, . . . , t_(M−1), respectively.

[0057] Meanwhile, the amplification section outputs M signals that are the delayed and output M signals s₀, s₁, . . . , s_(M−1) amplified with amplification factors a₀, a₁, . . . , a_(M−1), respectively.

[0058] In the filter apparatus of the invention, the predetermined real impulse constant r can be constructed so as to be equal to 2-3^(1/2) in a notation of a fixed point computation with a predetermined accuracy.

[0059] In the filter apparatus of the invention, the predetermined real impulse constant r can be constructed so as to satisfy

2-3^(1/2)−0.1≦r≦2-3^(1/2)+0.1.

[0060] A receiving apparatus according to another aspect of the invention has a signal receiving section, a reception-side filter section, a code generating section, a code-side filter section and a correlation detection section and is constructed as follows.

[0061] That is, the signal receiving section receives signals.

[0062] Meanwhile, the reception-side filter section accepts the received signals as an input sequence and filters and outputs it.

[0063] Further, the code generating section generates spreading codes.

[0064] Then, the code-side filter section accepts the generated spreading codes as an input sequence and filters and outputs it.

[0065] Meanwhile, the correlation detection section performs correlation detection on a result of filtering in the reception-side filter section with respect to a result of filtering in the code-side filter-section to recover the transmitted data signal.

[0066] Further, each of the reception-side filter section and the correlation detection section is the above-described filter apparatus with respect to a predetermined real impulse constant r, a predetermined real number constant x, a predetermined delay time constant D and a predetermined positive integer N.

[0067] In the receiving apparatus of the invention, the code generating section can be constructed so as to generate, as spreading codes, an orthogonal code sequence (including an M-sequence, Gold-codes, an orthogonal code sequence acquired from a Walsh function, an orthogonal code sequence acquired from a Chebyshev's polynomial, a Baker sequence and a Manchester-coded orthogonal sequence; the same applied hereinafter), or a complex orthogonal code sequence in which a real portion and an imaginary portion are respectively composed of different orthogonal code sequences.

[0068] The filter apparatus of the invention can be a complex filter apparatus by constructing the input terminal so as to accept a sequence of complex numbers as an input signal, and constructing the output terminal so as to output a sequence of complex numbers as an output signal.

[0069] A complex filter apparatus according to a further aspect of the invention filters a sequence of complex numbers, has a complex input section, a real filter section, an imaginary filter section and a complex output section and is constructed as follows.

[0070] That is, the complex input section accepts inputting of a sequence of complex numbers.

[0071] Meanwhile, the real filter section filters a sequence of real portions in the sequence of complex numbers inputting of which has been accepted by the complex input section.

[0072] Further, the imaginary filter section filters a sequence of imaginary portions in the sequence of complex numbers inputting of which has been accepted by the complex input section.

[0073] And, the complex output section outputs a sequence of complex numbers whose real portions are the sequence output by the real filter section and whose imaginary portions are the sequence output by the imaginary filter section.

[0074] Meanwhile, each of the real filter section and the imaginary filter section is the filter apparatus with respect to a predetermined real impulse constant r, a predetermined real number constant x, a predetermined delay time constant D and a predetermined positive integer M.

[0075] A spread modulation apparatus according to a further aspect of the invention uses the above-described complex filter apparatus, has a scramble section and a modulation section and is constructed as follows.

[0076] That is, the scramble section outputs a complex number that is a real portion and imaginary portion of an input digital complex number scrambled with a predetermined spreading code of a chip rate 1/D.

[0077] Further, the modulation section spread-modulates the complex number output from the scramble section by giving it to the complex filter apparatus as an input.

[0078] In the spread modulation apparatus of the invention, scrambling by the scramble section can be constructed so as to conform to the IMT-2000 W-CDMA system standard, CDMA 2000 system standard or Wireless LAN IEEE 802.11b standard.

[0079] In the spread modulation apparatus of the invention, the scramble section can be constructed so as to perform scrambling using one of a Gold-code, a Baker sequence and a Walsh-Hadamard code as a spreading code.

[0080] In the spread modulation apparatus of the invention, the spreading code of the scramble section can be constructed so as to be given by individual points on an orbit of a map dynamical system having ergodicity.

[0081] In the spread modulation apparatus of the invention, the dynamical system having ergodicity in the scramble section can be constructed so as to be a map dynamical system having a Chebyshev's polynomial of a secondary order or higher as a map.

[0082] An output apparatus according to a further aspect of is the invention outputs a pseudorandom sequence of a length N (N≧1) with respect to a predetermined real impulse constant r (−1<r<1) and a predetermined real number constant C (C≠0), has a sequence accepting section, a calculation section and a random number output section and is constructed as follows.

[0083] That is, the sequence accepting section accepts inputting of spreading codes (z[1], z[2], . . . , z[L]) of a length L (L≧1) as a sequence initial value.

[0084] Meanwhile, the calculation section calculates, from the input-accepted (z[1], z[2], . . . , z[L]), (z′[1], z′[2], . . . , z′[N]) that satisfy

z′[1]=CΣ _(j=1) ^(M)(−r)^(M+1−j) z[j];

z′[2]=CΣ _(j=1) ^(M)(−r)^(M+1−j) z[j+1];

z′[N]=CΣ _(j=1) ^(M)(−r)^(M+1−j) z[j+N−1]

[0085] with respect to a predetermined positive integer M (1≦M≦N, M+N<L).

[0086] Further, the random number output section outputs the (z′[1], z′[2], . . . , z′[N]) as a pseudorandom sequence.

[0087] Calculation in the calculation section is equivalent to a process of properly setting parameters for the filter apparatus and acquiring a part of a sequence, output when (z[1], z[2], . . . , z[L]) are given as inputs, as (z′[1], z′[2], . . . , z′[N]).

[0088] In the output apparatus of the invention, the spreading codes of the length L can be constructed so as to be an orthogonal code sequence (including an M-sequence, Gold-codes, an orthogonal code sequence acquired from a Walsh function, an orthogonal code sequence acquired from a Chebyshev's polynomial, a Baker sequence and a Manchester-coded orthogonal sequence).

[0089] In the output apparatus of the invention, the predetermined real impulse constant r can be constructed so as to be equal to 2-3^(1/2) in a notation of a fixed point computation with a predetermined accuracy.

[0090] In the output apparatus of the invention, the predetermined real impulse constant r can be constructed so as to satisfy

2-3^(1/2)−0.1≦r≦2-3^(1/2)+0.1.

[0091] A transmitting apparatus according to a further aspect of the invention has a sequence accepting section, the above-described output apparatus which outputs a pseudorandom sequence of a length N, a spreading section and a signal transmitting section and is constructed as follows.

[0092] That is, the signal accepting section accepts inputting of a transfer signal.

[0093] Meanwhile, the spreading section spectrum-spreads the input-accepted transfer signal with the output pseudorandom sequence of the length N as spreading codes.

[0094] Further, the signal transmitting section transmits a signal of a result of the spectrum spreading.

[0095] The transmitting apparatus of the invention further has a selecting section and a parameter transmitting section and can be constructed as follows.

[0096] That is, the selecting section selects spreading codes P=(z[1], z[2], . . . , z[L]).

[0097] Meanwhile, the parameter transmitting section transmits the selected spreading codes P=(z[1], z[2], . . . , z[L]).

[0098] Further, the output apparatus accepts the selected spreading codes P=(z[1], z[2], . . . , z[L]) as a sequence initial value.

[0099] The transmitting apparatus of the invention further has a parameter receiving section and can be constructed as follows.

[0100] That is, the parameter receiving section receives spreading codes Q=(z[1], z[2], . . . , z[L]).

[0101] Meanwhile, the pseudorandom sequence output apparatus accepts the received spreading codes Q=(z[1], z[2], . . . , z[L]) as a sequence initial value.

[0102] A receiving apparatus according to a further aspect of the invention has signal receiving section, the above-described output apparatus which outputs a pseudorandom sequence of a length N, a despreading section and a signal output section and is constructed as follows.

[0103] That is, the signal receiving section receives a signal.

[0104] Meanwhile, the despreading section spectrum-despreads the received signal with the output pseudorandom sequence of the length N as spreading codes.

[0105] Further, the signal output section outputs a signal of a result of the spectrum despreading as a transfer signal.

[0106] The receiving apparatus of the invention further has a selecting section and a parameter transmitting section and can be constructed as follows.

[0107] That is, the selecting section selects spreading codes Q=(z[1], z[2], . . . , z[L]).

[0108] Meanwhile, the parameter transmitting section transmits the selected spreading codes Q=(z[1], z[2], . . . , z[L]).

[0109] Further, the output apparatus accepts the selected spreading codes Q=(z[1], z[2], . . . , z[L]) as a sequence initial value.

[0110] The receiving apparatus of the invention further has a parameter receiving section and can be constructed as follows.

[0111] That is, the parameter receiving section receives spreading codes P=(z[1], z[2], . . . , z[L]).

[0112] Meanwhile, the output apparatus accepts the received spreading codes P=(z[1], z[2], . . . , z[L]) as a sequence initial value.

[0113] The transmitting apparatus, which transmits the P as parameters, can be combined with the receiving apparatus, which receives the P as parameters, into a communication system. In the communication system, the direction of transmission/reception of parameters is the same as the direction of transmission/reception of transfer signals.

[0114] The transmitting apparatus, which receives the Q as parameters, can be combined with the receiving apparatus, which transmits the Q as parameters, into a communication system. In the communication system, the direction of transmission/reception of parameters is opposite to the direction of transmission/reception of transfer signals.

[0115] A filter method for a predetermined real impulse constant r (−1<r<1), a predetermined real number constant x (x≠0), a predetermined delay time constant D and a predetermined positive integer M (M>1), according to a further aspect of the invention, has an input step, a delay amplification step, an adding step and an output step and is constructed as follows.

[0116] That is, the input step accepts inputting of an input signal.

[0117] Meanwhile, the delay amplification step outputs M signals that are the input-accepted input signal delay-amplified with a delay time to and an amplification factor a₀, with a delay time t₁ and an amplification factor a₁, . . . , and with a delay time t_(M−1) and an amplification factor a_(M−1), respectively.

[0118] Further, the adding step outputs a sum of the delay-amplified and output M signals.

[0119] And, the output step outputs the added and output signal.

[0120] Meanwhile, t₀, t₁, . . . , t_(M−1) is an arithmetical progression of a common difference D.

[0121] Further, a₀, a₁, . . . , a_(M−1) is a geometrical progression of a common ratio −r or −1/r.

[0122] In the filter method of the invention, the delay amplification step has a delay step and an amplification step and can be constructed as follows.

[0123] That is, the delay step outputs M signals that are the input-accepted input signal delayed with delay times t₀, t₁, . . . , t_(M−1), respectively.

[0124] Meanwhile, the amplification step outputs M signals that are the delayed and output M signals s₀, s₁, . . . , s_(M−1) amplified with amplification factors a₀, a₁, . . . , a_(M−1), respectively.

[0125] In the filter method of the invention, the predetermined real impulse constant r can be constructed so as to be equal to 2-3^(1/2) in a notation of a fixed point computation with a predetermined accuracy.

[0126] In the filter method of the invention, the predetermined real impulse constant r can be constructed so as to satisfy

2-3^(1/2)−0.1≦r≦2-3^(1/2)+0.1.

[0127] A receiving method according to a further aspect of the invention has a signal receiving step, a reception-side filter step, a code generating step, a code-side filter step and a correlation detection step and can be constructed as follows.

[0128] That is, the signal receiving step receives signals.

[0129] Meanwhile, the reception-side filter step accepts the received signals as an input sequence and filters and outputs it.

[0130] Further, the code generating step generates spreading codes.

[0131] And, the code-side filter step accepts the generated spreading codes as an input sequence and filters and outputs it.

[0132] Meanwhile, the correlation detection step performs correlation detection on a result of filtering in the reception-side filter step with respect to a result of filtering in the code-side filter step to recover the transmitted data signal.

[0133] Further, each of the reception-side filter step and the correlation detection step performs a filtering process by the above-described filter method with respect to a predetermined real impulse constant r, a predetermined real number constant x, a predetermined delay time constant D and a predetermined positive integer N.

[0134] In the receiving method of the invention, the code generating step can be constructed so as to generate, as spreading codes, an orthogonal code sequence. (including an M-sequence, Gold-codes, an orthogonal code sequence acquired from a Walsh function, an orthogonal code sequence acquired from a Chebyshev's polynomial, a Baker sequence and a Manchester-coded orthogonal sequence; the same applied hereinafter), or a complex orthogonal code sequence in which a real portion and an imaginary portion are respectively composed of different orthogonal code sequences.

[0135] The receiving method of the invention can be a complex filter method by accepting a sequence of complex numbers as an input signal in the input step, and outputting a sequence of complex numbers as an output signal in the output step.

[0136] A complex filter method according to a further aspect of the invention filters a sequence of complex numbers, has a complex input step, a real filter step, an imaginary filter step and a complex output step and is constructed as follows.

[0137] That is, the complex input step accepts inputting of a sequence of complex numbers.

[0138] Meanwhile, the real filter step filters a sequence of real portions in the sequence of complex numbers inputting of which has been accepted in the complex input step.

[0139] Further, the imaginary filter step filters a sequence of imaginary portions in the sequence of complex numbers inputting of which has been accepted in the complex input step.

[0140] And, the complex output step outputs a sequence of complex numbers whose real portions are the sequence output by the real filter step and whose imaginary portions are the sequence output in the imaginary filter step.

[0141] Meanwhile, each of the real filter step and the imaginary filter step performs a filtering process by the above-described filter method with respect to a predetermined real impulse constant r, a predetermined real number constant x, a predetermined delay time constant D and a predetermined positive integer M.

[0142] A spread modulation method according to a further aspect of the invention uses the above-described complex filter method, has a scramble step and a modulation step and is constructed as follows.

[0143] That is, the scramble step outputs a complex number that is a real portion and imaginary portion of an input digital complex number scrambled with a predetermined spreading code of a chip rate 1/D.

[0144] Meanwhile, the modulation step spread-modulates the complex number output in the scramble step by giving it to the complex filter method as an input.

[0145] In the spread modulation method of the invention, scrambling by the scramble step can be constructed so as to conform to the IMT-2000 W-CDMA system standard, CDMA 2000 system standard or Wireless LAN IEEE 802.11b standard.

[0146] In the spread modulation method of the invention, the scramble step can be constructed so as to perform scrambling using one of a Gold-code, a Baker sequence and a Walsh-Hadamard code as a spreading code.

[0147] In the spread modulation method of the invention, the spreading code of the scramble step can be constructed so as to be given by individual points on an orbit of a map dynamical system having ergodicity.

[0148] In the spread modulation method of the invention, the dynamical system having ergodicity in the scramble step can be constructed so as to be a map dynamical system having a Chebyshev's polynomial of a secondary order or higher as a map.

[0149] An output method according to a further aspect of the invention outputs a pseudorandom sequence of a length L (L≧1) with respect to a predetermined real impulse constant r (−1<r<1) and a predetermined real number constant C (C≠0), a sequence accepting step, a calculation step and a random number output step and is constructed as follows.

[0150] That is, the sequence accepting step accepts inputting of spreading codes (z[1], z[2], . . . , z[L]) of a length N (N≧1) as a sequence initial value.

[0151] Meanwhile, the calculation step calculates, from the input-accepted (z[1], z[2], . . . , z[L]), (z′[1], z′[2], . . . , z′[N]) that satisfy

z′[1]=CΣ _(j=1) ^(M)(−r)^(M+1−j) z[j];

z′[2]=CΣ _(j=1) ^(M)(−r)^(M+1−j) z[j+1];

z′[N]=CΣ _(j=1) ^(M)(−r)^(M+1−j) z[j+N−1]

[0152] with respect to a predetermined positive integer M (1≦M≦N, M+N<L).

[0153] Further, the random number output step outputs the (z′[1], z′[2], . . . , z′[N]) as a pseudorandom sequence.

[0154] In the pseudorandom sequence output method of the invention, the spreading codes of the length L can be constructed so as to be an orthogonal code sequence (including an M-sequence, Gold-codes, an orthogonal code sequence acquired from a Walsh function, an orthogonal code sequence acquired from a Chebyshev's polynomial, a Baker sequence and a Manchester-coded orthogonal sequence).

[0155] In the pseudorandom sequence output method of the invention, the predetermined real impulse constant r can be constructed so as to be equal to 2-3^(1/2) in a notation of a fixed point computation with a predetermined accuracy.

[0156] In the pseudorandom sequence output method of the invention, the predetermined real impulse constant r can be constructed so as to satisfy

2-3^(1/2)−0.1≦r≦2-3^(1/2)+0.1.

[0157] A transmitting method according to a further aspect of the invention has a signal accepting step, a random number output step, a spreading step and a signal transmitting step and is constructed as follows.

[0158] That is, the signal accepting step accepts inputting of a transfer signal.

[0159] Meanwhile, the random number output step outputs a pseudorandom sequence by the above-described output method, which outputs a pseudorandom sequence of a length N.

[0160] Further, the spreading step spectrum-spreads the input-accepted transfer signal with the output pseudorandom sequence of the length N as spreading codes.

[0161] And, the signal transmitting step transmits a signal of a result of the spectrum spreading.

[0162] The transmitting method of the invention may have a selecting step and a parameter transmitting step and can be constructed as follows.

[0163] That is, the selecting step selects spreading codes P=(z[1], z[2], . . . , z[L]).

[0164] Meanwhile, the parameter transmitting step transmits the selected spreading codes P=(z[1], z[2], . . . , z[L]).

[0165] Further, the random number output step accepts the selected spreading codes P=(z[1], z[2], . . . , z[L]) as a sequence initial value.

[0166] The transmitting method of the invention further has a parameter receiving step and can be constructed as follows.

[0167] That is, the parameter receiving step receives spreading codes Q=(z[1], z[2], . . . , z[L]).

[0168] Meanwhile, the random number output step accepts the received spreading codes Q=(z[1], z[2], . . . , z[L]) as a sequence initial value.

[0169] A receiving method according to a further aspect of the invention has a signal receiving step, a random number output step, a despreading step and a signal output step and is constructed as follows.

[0170] That is, the signal receiving step receives a signal.

[0171] Meanwhile, the random number output step outputs a pseudorandom sequence by the above-described output method which outputs a pseudorandom sequence of a length N.

[0172] Further, the despreading step spectrum-despreads the received signal with the output pseudorandom sequence of the length N as spreading codes.

[0173] And, the signal output step outputs a signal of a result of the spectrum despreading as a transfer signal.

[0174] The receiving method of the invention has a selecting step and a parameter transmitting step and can be constructed as follows.

[0175] That is, the selecting step selects spreading codes Q=(z[1], z[2], . . . , z[L]).

[0176] Meanwhile, the parameter transmitting step transmits the selected spreading codes Q=(z[1], z[2], . . . , z[L]).

[0177] Further, the random number output step accepts the selected spreading codes Q=(z[1], z[2], . . . , z[L]) as a sequence initial value.

[0178] The receiving method of the invention by further has a parameter receiving step and can be constructed as follows.

[0179] That is, the parameter receiving step receives spreading codes P=(z[1], z[2], . . . , z[L]).

[0180] Meanwhile, the random number output step accepts the received spreading codes P=(z[1], z[2], . . . , z[L]) as a sequence initial value.

[0181] A program according to a further aspect of the invention is constructed so as to allow a computer to function as an input section, a delay amplification section, an adding section and an output section with respect to a predetermined real impulse constant r (−1<r<1), a predetermined real number constant x (x≠0), a predetermined delay time constant D and a predetermined positive integer M (M>1).

[0182] That is, the input section accepts inputting of an input signal.

[0183] Meanwhile, the delay amplification section outputs M signals that are the input-accepted input signal delay-amplified with a delay time to and an amplification factor a₀, with a delay time t₁ and an amplification factor a₁, . . . , and with a delay time t_(M−1) and an amplification factor a_(M−1), respectively.

[0184] Further, the adding section outputs a sum of the delay-amplified and output M signals.

[0185] And, the output section outputs the added and output signal.

[0186] Meanwhile, t₀, t₁, . . . , t_(M−1) is an arithmetical progression of a common difference D.

[0187] Further, the a₀, a₁, . . . , a_(M−1) is a geometrical progression of a common ratio −r or −1/r.

[0188] The program of the invention can be constructed so as to function, instead of the delay amplification section, as “a delay section and an amplification section” as follows.

[0189] That is, the delay section outputs M signals s₀, s₁, . . . , s_(M−1) that are the input-accepted input signal delayed with delay times t₀, t₁, . . . , t_(M−1), respectively.

[0190] Meanwhile, the amplification section outputs M signals that are the delayed and output M signals s₀, s₁, . . . , s_(M−1) amplified with amplification factors a₀, a₁, . . . , a_(M−1), respectively.

[0191] In the program of the invention, the predetermined real impulse constant r can be constructed so as to be equal to 2-3^(1/2) in a notation of a fixed point computation with a predetermined accuracy.

[0192] A program according to a further aspect of the invention allows a computer to function as a sequence accepting section and a random number output section as follows in such a way that the computer outputs a pseudorandom sequence of a length N (N≧1) with respect to a predetermined real impulse constant r (−1<r<1) and a predetermined real number constant C (C≠0).

[0193] That is, the sequence accepting section accepts inputting of spreading codes (z[1], z[2], . . . , z[L]) of a length N (N≧1) as a sequence initial value.

[0194] Meanwhile, the random number output section is a calculation section which calculates, from the input-accepted (z[1], z[2], . . . , z[L]), (z′[1], z′[2], . . . , z′[N]) that satisfy

z=[1]=CΣ _(j=1) ^(M)(−r)^(M+1−j) z[j];

z′[2]=CΣ _(j=1) ^(M)(−r)^(M+1−j) z[j+1];

z′[N]=cΣ _(j=1) ^(M)(−r)^(M+1−j) z[j+N−1]

[0195] with respect to a predetermined positive integer M (1≦M≦N, M+N<L), and

[0196] outputs the (z′[1], z′[2], . . . , z′[N]) as a pseudorandom sequence.

[0197] The program of the invention can be functioned in such a way that in the computer, the spreading codes of the length L are functioned as an orthogonal code sequence (including an M-sequence, Gold-codes, an orthogonal code sequence acquired from a Walsh function, an orthogonal code sequence acquired from a Chebyshev's polynomial, a Baker sequence and a Manchester-coded orthogonal sequence).

[0198] The program of the invention can be constructed in such a way that the predetermined real impulse constant r is equal to 2-3^(1/2) in a notation of a fixed point computation with a predetermined accuracy.

[0199] The program of the invention can be recorded on a computer readable information recording medium (including a compact disk, flexible disk, hard disk, magneto-optical disk, digital video disk, magnetic tape or semiconductor memory).

[0200] The above-described various apparatuses and various methods can be realized by running the program recorded on the information recording medium of the invention on an information processing apparatus, such as a general-purpose computer, a portable terminal like a portable terminal, a PHS device or a game machine, or a parallel computer, DSP (Digital Signal Processor), FPGA (Field Programmable Gate Array) or the like, which has a memory apparatus, a calculation apparatus, an output apparatus, a communication apparatus, etc.

[0201] Further, pseudorandom sequences output by the above-described pseudorandom sequence output apparatus and output method can be recorded on a computer readable information recording medium.

[0202] Further, it is possible to distribute and sell the program of the invention itself and distribute and sell the information recording medium of the invention via a computer communication network, independent of those apparatuses.

BRIEF DESCRIPTION OF DRAWINGS

[0203]FIG. 1 is an exemplary diagram of the schematic structure of a pseudorandom sequence output apparatus according to the present invention.

[0204]FIG. 2 is a graph showing the outline of a Chebyshev map.

[0205]FIG. 3 is an exemplary diagram showing the schematic structure of an FIR filter usable in this embodiment.

[0206]FIG. 4 is a graph showing the simulation results of a bit error rate according to this scheme.

[0207]FIG. 5 is a graph showing the simulation results of the bit error rate according to this scheme.

[0208]FIG. 6 is a graph showing the simulation results of the bit error rate according to this scheme.

[0209]FIG. 7 is a graph showing the simulation results of the bit error rate according to this scheme.

[0210]FIG. 8 is a graph showing the simulation results of the bit error rate according to this scheme.

[0211]FIG. 9 is a graph showing the simulation results of the bit error rate according to this scheme.

[0212]FIG. 10 is a graph showing the simulation results of the bit error rate according to this scheme.

[0213]FIG. 11 is a graph showing the simulation results of the bit error rate according to this scheme.

[0214]FIG. 12 is a graph showing the simulation results of the bit error rate according to this scheme.

[0215]FIG. 13 is a graph showing the simulation results of the bit error rate according to this scheme.

[0216]FIG. 14 is a graph showing the simulation results of the bit error rate according to this scheme.

[0217]FIG. 15 is a graph showing the simulation results of the bit error rate according to this scheme.

[0218]FIG. 16 is a flowchart illustrating the steps of a pseudorandom sequence output method of the invention.

[0219]FIG. 17 is an exemplary diagram showing the schematic structure of a transmitting apparatus of the invention.

[0220]FIG. 18 is an explanatory diagram showing the behavior of direct spectrum spreading.

[0221]FIG. 19 is an exemplary diagram showing the schematic structure of a receiving apparatus of the invention.

[0222]FIG. 20 is an exemplary diagram showing an embodiment of the receiving apparatus in case of executing correlation detection.

[0223]FIG. 21 is an exemplary diagram showing an embodiment of the receiving apparatus which receives signals transmitted asynchronously.

[0224]FIG. 22 is a graph of simulation results showing the relationship between the number of users and the BER in a W-CDMA system in case where the present technique is adapted and the conventional W-CDMA system.

[0225]FIG. 23 is an exemplary diagram showing the schematic structure of an embodiment of a complex filter of the invention.

[0226]FIG. 24 is an exemplary diagram showing the schematic structure of a spread-modulation apparatus which performs a despread-modulation process for W-CDMA using the complex filter apparatus.

[0227]FIG. 25 is a graph showing the frequency characteristic of the complex filter apparatus.

[0228]FIG. 26 is a graph showing the spectrum distribution of signals transmitted by the spread modulation apparatus.

BEST MODE FOR CARRYING OUT THE INVENTION

[0229] Embodiments of the present invention will be described below. The embodiments described below are illustrative and do not restrict the scope of the invention. It is therefore possible for those skilled in the art to employ embodiments in which those individual elements or all the elements are replaced with their equivalent elements, but those embodiments are also included in the scope of the invention.

[0230] (First Embodiment)

[0231]FIG. 1 is an exemplary diagram (data flow diagram) showing the schematic structure of a pseudorandom sequence output apparatus according to the first embodiment of the invention. Description will be given below referring to this diagram.

[0232] An pseudorandom sequence output apparatus 101 according to this embodiment outputs a pseudorandom sequence of a length L (L≧1) with respect to a predetermined real impulse constant r (−1<r<1) and a predetermined real number constant C (C≠0), and has a sequence accepting section 102, a calculation section 103 and an output section 104.

[0233] That is, the sequence accepting section 102 accepts inputting of spreading codes z[1], z[2], . . . , z[L] of a length L (L≧1) as sequence initial values.

[0234] Meanwhile, the calculation section 103 calculates, from the input-accepted z[1], z[2], . . . , z[L]), (z′[1], z′[2], . . . , z′[N] that satisfy

z′[1]=CΣ _(j−1) ^(M)(−r)^(M+1−j) z[j];

z′[2]=CΣ _(j−1) ^(M)(−r)^(M+1−j) z[j+1];

z′[N]=CΣ _(j=1) ^(M)(−r)^(M+1−j) z[j+N−1]

[0235] with respect to a predetermined positive integer M (1≦M≦N, M+N<L).

[0236] Further, the output section 104 outputs the z′[1], z′[2], . . . , z′[N] as pseudorandom sequences.

[0237] Computation in the calculation section 103 can be realized by a combination of an adder/subtracter circuit and a multiplier circuit as well as by a polynomial operation by a computer. It may be realized by a floating point operation which guarantees a predetermined precision or can be realized by an operation involving a rational number. This point will be discussed later.

[0238] Acceptance of inputting of a sequence initial value and an integer parameter in the sequence accepting section 102 and outputting in the output section 104 can be done via a RAM (Random Access Memory) and a register in a CPU (Central Processing Unit) in case of a computer, and can be achieved by using a latch or the like in case of an electronic circuit.

[0239] As apparent from the aforementioned recursion equation, computations for acquiring z′[1], z′[2], . . . , z′[N] are independent of one another, so that computations can be done in parallel with a maximum parallelism N. As they are described by the recursion equation, it is possible to easily execution computations by looped repetitive operations.

[0240] As spreading codes to be a sequence initial value, an M-sequence, Gold-codes, Kasami-codes, Walsh-Hadamard orthogonal codes or chaos codes generated by a Chebyshev's polynomial or the like can be used. The following will describe the chaos codes generated by a Chebyshev's polynomial.

[0241]FIG. 2 is a graph showing a Chebyshev's polynomial (Chebyshev map). With an integer a (a≧0) being an order, the Chebyshev's polynomial can be defined by an addition theorem of a cosine function as

T _(a)(cos θ)=cos(aθ).

[0242] It can also be expressed directly by a rational polynomial as follows.

T ₀(x)=1;

T ₁(x)=x;

T ₂(x)=2x ²−1;

T ₃(x)=4x ³−3x.

[0243] A Chebyshev's polynomial y=T_(a)(x) with a≧1 is a rational map which maps an open zone −1<x<1 to an open zone −1<y<1.

[0244] This diagram shows a Chebyshev's polynomial of the second to fifth orders in a graph in the form of y=T₂(x), y=T₃(x), y=T4(x), y=T₅(x). The horizontal axis is the x axis and the vertical axis is the y axis.

[0245] The following are possible chaos codes generated by using such a Chebyshev's polynomial.

[0246] The first one is the most fundamental chaos codes which are computed by the following recursion equations.

z[i+1]=T _(a)(z[i])

[0247] The second one is an application of the above, which is computed using the recursion equations

y_(j)[1]=y_(j);

y _(j) [m+1]=T(p _(j) , y _(j) [m]);

z[n]=Π_(j=1) ^(s) T(q _(j) ,y _(j) [n])

[0248] where T(a,x)=T_(a)(x)

[0249] with respect to sequence initial values Y₁, Y₂, . . . , Y_(s) (−1<Y₁<1, −1<Y2<1, . . . , −1<Y_(a)<1), predetermined integer constants q₁, q₂, . . . , q_(s) and predetermined integer parameters p₁, p₂, . . . , p_(s) (where q₁ mod p₁≠0, q₂ mod p₂≠0, . . . , q_(s) mod p_(s)≠0).

[0250] (Theoretical Background 1)

[0251] That a correlation function of a pseudorandom sequence of a length N which is output when chaos codes are generaged by a Chebyshev's polynomial becomes the aforementioned optimal correlation function is based on the theory of a Lebesgue spectrum which is developed in the ergodic theory. This theory is disclosed in the following document.

[0252] V. I. Arnold and A. Avez “Ergodic Problems of Classical Mechanics” (W. A. Benjamin, New York, 1968)

[0253] The theory of the Lebesgue spectrum will be discussed below.

[0254] Now, let sequences X₁, X₂, . . . generated from a dynamical system X_(n+1)=F(X_(n)) have ergodicity with respect to a limiting density distribution function (invariant measure) ρ(x)dx on an area Q which defines the dynamical system.

[0255] Then, Hilbert space L₂ in which a norm operation ∥·∥ is naturally defined as follows

∥v∥²=<v,v>

[0256] from an inner product relating to this invariant measure can be considered.

[0257] According to the aforementioned document, an orthonormal base {φ_(λ,j)}_(λεA,jεJ) which satisfies a special property depending on a given dynamical system uniquely exists in this L₂ space. This is called a Lebesgue spectrum.

[0258] Here, λ labels each class of the Lebesgue spectrum and j is a label indicating the function of each class and corresponds to countably many integers of 0 or greater.

[0259] It is understood from this definition that the Lebesgue spectrum is an orthonormal function set composed of many functions. Particularly, in case where the number of possible types of the label λ (cardinality of Λ) is infinite, this Lebesgue spectrum is called a infinite Lebesgue spectrum. In case where this Lebesgue spectrum is not only an orthonormal base but also is a complete orthogonal base in the L₂ space, this Lebesgue spectrum is called a complete Lebesgue spectrum.

[0260] The unique property of the aforementioned Lebesgue spectrum is to satisfy

φ_(λ,j)OF=φ_(λ,j+1)

[0261] where (fOg)(x)=f(g(x)) for every λεΛ, jεJ.

[0262] That is, if every function φ_(λ,0) is given, the Lebesgue spectrum function φ_(λ,j) corresponding to j≧1 of the class λ can be acquired by repeatedly applying a map F(·) which defines a dynamical system.

[0263] According to the assumption that the Lebesgue spectrum forms an orthonormal set, those individual functions φ_(λ,j) is orthogonal to a function φ_(λ,j′) for arbitrary other j≠j′ in the same class and an arbitrary function φ_(λ′,j″) for λ≠λ′ in an arbitrary other class.

[0264] As an ergodic dynamical system having a complete Lebesgue spectrum, there is a Chebyshev-chaos dynamical system given by a Chebyshev's polynomial of the second order or higher to be discussed later. The Chebyshev-chaos dynamical system is disclosed in the following document.

[0265] R. L. Adler, T. J. Rivlin “Proc. Am. Math. Soc. 15” (1964, p794)

[0266] Provided that a function B(x) of L₂ can be developed by the Lebesgue spectrum as follows.

B(x)=Σ_(j=1) ^(N) a _(λ,j)(x)

[0267] In this case, from the orthogonality of the Lebesgue spectrum, a correlation function

<B(x)B(F ¹(x))>≡<B ₀ , B _(l)>

is given by a Lebesgue spectrum developing coefficient as follows.

<B ₀ , B ₁>=Σ_(m=1) ^(∞) a _(λ,m) a _(λ,m−1)

[0268] Because of the ergodicity, this correlation function is equal to

lim_(N→∞)(1/N)Σ_(n=1) ^(N) B(X _(n))B(X _(n+1))

[0269] which is the time average of B(x)B(F¹(x)).

[0270] While each X_(n) is generated from an recursion equation X_(n+1)=F(X_(n)), the ergodic equation that the time average is equal to the space average satisfies except for an exceptional initial value X₁ of measure 0 on Q.

[0271] Suppose that

a _(λ,m) =C(−r)^(m)(m≧0)

[0272] where C is a non-zero constant. Substituting this into the equation that gives the above correlation function yields

<B ₀ ,B ₁ >=C ²(−r)¹(1−r ^(2N))/(1−r ²)

[0273] and the correlation function exponentially decreases as follows.

C(1)≡<B ₀ ,B ₁ >=C′(−r)¹(N→∞)

[0274] As apparent from the above, with regard to a code shift amount 1, a sequence having a correlation function which exponentially dumps in the form of (−r)¹ can be created freely with respect to an arbitrary r (−1<r<1).

[0275] Particularly, as discovered by Mazzini, in case where z′[1], z′[2], . . . , z′[N] are selected at the same bit error rate as mentioned above, the theoretical number of users can be increased by 15% from that in the case where random codes (including a Gold-code and Kasami-code) are a spreading sequence.

[0276] The spreading sequence that provides the variance of interference noise which becomes

σ_(optional)=3^(1/2)(K−1)/(6N)

[0277] should be such that the asymptotical behavior of its correlation function becomes

C(s)≅Const.×(−r)^(−s)(0<r<1)

[0278] Therefore, it is sufficient to prepare a filter which is designed as with the ergodic dynamical system having a Lebesgue spectrum and the aforementioned B(x) defined by the Lebesgue spectrum function.

a _(λ,m) =C(−r)^(m)(m≧0);

r=2-3^(1/2)

[0279] The issue here is how the ergodic dynamical system F(x) and the Lebesgue spectrum {φ_(λ,j)}_(λεΛ,j)ε_(J) can be constructed in an easily realizable manner. The following will discuss the structure by a Chebyshev map.

[0280] Let us consider a Chebyshev's polynomial T_(p)(x) (p≧2) of the second order or higher. It is known that this Chebyshev's polynomial is defined by T_(p)(cos θ)=cos(pθ) as mentioned above, and is orthogonal to integers p, q where q≠p under a distribution function

ρ(x)dx=dx/(π(1−x ²))

[0281] on a closed zone Q=[−1,1] for the value of each p, as follows.

∫_(M) T(p, x)T(q, x)ρ(x)dx=0

[0282] Those Chebyshev's polynomial and distribution function can construct the Hilbert space L₂. In this case, the Chebyshev's polynomials become an orthogonal base which is complete in the Hilbert space L₂.

[0283] The aforementioned document discloses that a dynamical system given by Chebyshev maps of the second or higher order has ergodicity and a mixing property stronger than that. The ergodic invariant measure in this case is given by a density function ρ(x) which defines the aforementioned orthogonality.

[0284] From those properties, provided that for j≧0, q(mod p)≠0, is a function set φ_(q,j)(x) defined as follows

φ_(q,j) =T(qp ^(j) , x),

[0285] it is understood from the orthogonality of the Chebyshev's polynomial itself and a relational equation

φ_(q,j)(T(p, x))=T(qp ^(j)(T(p, x)))=T(qp ^(j)+1, x)=φ_(q,j)+1

[0286] that the function set φ_(q,j)(x) is a Lebesgue spectrum.

[0287] Thus, if a filter is designed, for an integer M (1≦M≦N), as

B(x)=Σ_(j=1) ^(N)(−r)^(j)φ_(q,j)(x)

[0288] where r=2-3^(1/2), spreading code for an asynchronous CDMA communication system having a correlation function C(s)≅Const.×(−r)^(−s) can be constructed from the explicit solution of the correlation function of the aforementioned Lebesgue spectrum theory. As mentioned above, this is shown by the Mazzini's theory and the number of users in asynchronous CDMA based on ordinary random codes can be increased by 15% under the condition of a constant bit error rate.

[0289] Let us pay attention to

B(X ₁)=Σ_(j=1) ^(M)(−r)^(j)φ_(q,j)(X ₁)=Σ_(j=1) ^(M)(−r)^(j) T(qp ^(j) , X ₁)=Σ_(j=1) ^(M)(−r)^(j) T(q, X _(1+j))

[0290] are satisfied, and for an arbitrary integer m (0≦m≦N−1),

B(X _(m))=Σ_(j=1) ^(M)(−r)^(j)φ_(q,j)(X _(m))=Σ_(j=1) ^(M)(−r)^(j) T(qp ^(j) , X _(m))=Σ_(j=1) ^(M)(−r)^(j) T(q, X _(m+j))

[0291] For q=1, T_(pq)(x)=x and this function B(X) satisfies B(X_(m))=Σ_(j=1) ^(M)(−r)^(j)X_(m+j).

[0292] This means an operation of taking the sum of the results of multiplying sequences X_(m+1), X_(m+2), . . . , X_(m+j), . . . , X_(m+M−1), X_(m+M) (1≦j≦M) respectively by a constant given to C(−r)^(M+1−j).

[0293] This is non other than the operation of an FIR filter (Finite Impulse Response Filter) which is one of basic filters of digital signal processing.

[0294] Therefore, it is possible to construct a fast and low power consumption device which achieves computations according to the invention with this FIR filter. The following will describe such a device.

[0295] (Embodiment of Filter)

[0296]FIG. 3 is an exemplary diagram showing the schematic structure of a filter constructed in such a manner.

[0297] A filter 201 accepts inputting of various spreading code sequences X₁, X₂, X₃, . . . , such as a Chebyshev-chaos type spreading code sequence, as an input sequence.

[0298] The accepted spreading code sequences are sequentially delayed and distributed by delay circuits 202 connected in series. A delay time is a chip length D. That is, the delay times are 0, D, 2D, 3D, 4D, . . . , (N−1)D. Thus, the delay times become an arithmetical progression with-the chip length D as a common difference.

[0299] Another delay device may be provided at the preceding stage of the delay circuit 202. In this case, the delay time of each delayed sequence to be given to an amplifier 203 is incremented by the delay time of another delay device. When the delay time of another delay device is set to D, particularly, sequences delayed by D, 2D, 3D, 4D, . . . , ND are input to the amplifiers 203.

[0300] The amplifier 203 amplifies a spreading code which sequentially appears between the delay circuits 202. In this diagram, for a predetermined real number constant x, the amplification factors are x(−r)¹, x(−r)², x(−r)³, . . . , x(−r)^(M−1), x(−r)^(M), respectively. That is, the amplification factors become a geometrical progression with r being a common ratio.

[0301] The optimal case here is when r is a real impulse constant defined by 2-3^(1/2) but even if r does not strictly satisfy that, it can be used to generate spreading codes in an asynchronous CDMA communication system as long as −1<r<1. In case where a fixed point computation is performed, particularly, a value closest to 2-3^(1/2) with that accuracy can be used.

[0302] Signals amplified by the amplifiers 203 are added by an adder 204 and pseudorandom sequences Y₁, Y₂, Y₃, . . . are sequentially output as output sequences.

[0303] For easier understanding, in case where the delay time of an output with respect to an input is neglected and there is an infinitely long input, when sequences to be input are sequentially . . . , s⁻², s⁻¹, s₁, s₂, . . . , the outputs of the FIR filter 201 become . . . ,

x(s_(−N−1)(−r)^(N−1+ . . . +s) ⁻⁴(−r)²+s⁻³(−r)¹+s⁻²),

x(s_(−N)(−r)^(N−1)+ . . . +s⁻³(−r)²+s⁻²(−r)¹+s⁻¹),

x(s_(−N+1)(−r)^(N−1)+ . . . +s⁻²(−r)²+s⁻¹(−r)¹+s₀),

x(s_(−N+2)(−r)^(N−1)+ . . . +s⁻¹(−r)²+s₀(−r)¹+s₁),

x(s_(−N+3)(−r)^(N−1)+ . . . +s₀(−r)²+s₁(−r)¹+s₂),

. . . .

[0304] With this construction, the delay times of a plurality of delay sequences to be output from the delay circuit 202 are an arithmetical progression with a common difference D and their respective amplification factors are a geometrical progression with a common ratio (−r) or common ratio (−1/r).

[0305] Each of those delay circuit 202, amplifiers 203 and adder 204 can be constructed by a simple arithmetic operation circuit. Therefore, arithmetic operations may be performed based on software using a computer or may be performed with exclusive hardware constructed using an ASIC, DSP, FPGA or the like.

[0306] Although the delay circuit 202 and the amplifiers 203 are connected by lines efficiently in this embodiment, the same effect can be acquired, for example, by connecting

[0307] a delay circuit with a delay time 0 and an amplifier with an amplification factor x(−r)⁰,

[0308] a delay circuit with a delay time D and an amplifier with an amplification factor x(−r)¹,

[0309] a delay circuit with a delay time D and an amplifier with an amplification factor x(−r)², . . .

[0310] a delay circuit with a delay time D and an amplifier with an amplification factor x(−r)^(N−1)

[0311] in parallel to a terminal which accepts input sequences and connecting the delaying and amplifying results to the adder. In this case, any one of the combinations of the individual delay circuits and amplifiers may be set close to the adder.

[0312] (Theoretical Background 2)

[0313] Let us go back to the discussion. In case where chaos codes generated by using a Chebyshev's polynomial are used as spreading codes, a code sequence can be set periodic.

[0314] That is, when X_(j)=X_(j+N+1), it is unnecessary to prepare 2N−1 values X₁, . . . , X_(2N−1). Only N X₁, . . . , X_(N) can ensure computation of B(X_(m)) for every m (0≦m≦N) using the periodicity. It is therefore possible to further shorten the computation time.

[0315] Likewise, it is understood that the product of the Chebyshev's polynomial

T(p₁, x₁)T(p₂, x₂) . . . T(p_(s), x_(s))

[0316] becomes a complete orthogonal base on the s-dimensional cubic [−1,1]^(s).

[0317] In case where this filter 201 is used in the embodiment of the random output apparatus, s products

z[m]=T(q ₁ , x ₁)T(q ₂ , x ₂) . . . T(q ₃ , x ₃)

[0318] are calculated with respect to s-dimensional real numbers x_(i), x₂, . . . , x_(s), respectively generated from a Chebyshev map dynamical system which is determined from s integer parameters p₁, p₂, . . . , p_(s) such that q₁ mod p₁≠0, q₂ mod p₂≠0, . . . , q_(s) mod p_(s)≠0 are respectively satisfied for s predetermined positive integers q₁, q₂, . . . , q_(s), and 1≦m≦2N−1.

[0319] Then, the correlation function of pseudorandom sequences of the length N created from the computed values z[1], z[2], . . . , z[2N−1],

z′[1]Σ_(j=1) ^(M)(−r)^(j) z[j];

z′[2]Σ_(j=1) ^(M)(−r)^(j) z[j+1];

. . .

z′[N]Σ _(j=1) ^(M)(−r)^(j) z[j+N+1]

[0320] satisfies

C(s)*% Const.×(−r)^(−s).

[0321] If r is defined as r=2-3^(1/2) and the code length N is set sufficiently long, the variance of interference noise of asynchronous CDMA which has pseudorandom sequences created from the s-dimensional direct product chaos dynamical system as spreading codes is given by

σ_(optimal)=3^(1/2)(K−1)/(6N)

[0322] from the Mazzini's theory, the number of users at the same bit error rate can surely be increased by 15% as compared with the case of the existing asynchronous CDMA communication system.

[0323] If there is F(p, x) which satisfies the relationship (topologically conjugate) of

F(p, G(x))=G(T(p, x))

[0324] with respect to a Chebyshev map T(p, x) and a diffeomorphism map G(x), this F(p, x) has a Lebesgue spectrum equivalent to that of a Chebyshev map, and further, a chaos sequence which causes this autocorrelation function to dump like (−r)¹ can be Constructed similarly.

(Experimental Results)

[0325] The following illustrates the simulation results of computing the bit error rate in the present scheme with respect to the number of users (User) K and the number of taps (Number of Taps) M with the length N of a pseudorandom sequence being fixed. Spreading codes (Spreading Sequence) to be given are Chebyshev codes (Cebyshev), Gold-codes (Gold Seq) and a typical random sequence (Random (Uniform)). The following parameters were used in this scheme.

[0326] s=1

[0327] p=2 (the order of the Chebyshev generator is equivalent to 2)

[0328] FIGS. 4 to 7 correspond to the code length N=31, FIGS. 8 to 11 correspond to the code length N=63, and FIGS. 12 to 15 correspond to N=127.

[0329] The results of this scheme are Cebyshef+FIR, Gold Seq+FIR and Random+FIR in the graphs and acquired with respect to r=2-3^(1/2).

[0330] From those simulation results, it is seen that even when any spreading code is used, the number of users increased by 15% at the same bit error rate can be guaranteed as compared with the conventional scheme.

[0331] It is also understood that the bit error rate with respect to the tap number M is saturated at about M=2 to 5. Therefore, it is also apparent that such a number is enough for the number of filter stages M.

[0332] In addition, it is understood that the spreading codes to be given should not necessarily be chaos codes using a Chebyshev's polynomial.

[0333] (Details of Output Method)

[0334]FIG. 16 is a flowchart illustrating a process to be executed in the pseudorandom sequence output apparatus 101, i.e., the steps of the pseudorandom sequence output method of the invention.

[0335] The pseudorandom sequence output apparatus 101 accepts a sequence initial value and an integer parameter (step S301), computes a pseudorandom sequence based on them and the aforementioned asymptotical equation (step S302), outputs the computed pseudorandom sequence (step S303), then terminates this process.

[0336] As apparent from the above, the pseudorandom sequence output method of the invention can easily be realized by an information processing apparatus, such as a general-purpose computer, a parallel computer, a portable terminal, particularly, a communication terminal, or a game machine.

[0337] It is easy to execute the pseudorandom sequence output method of the invention using a digital circuit, such as DSP or FPGA (Field Programmable Gate Array).

[0338] (Embodiment of Transmitting Apparatus)

[0339]FIG. 17 is an exemplary diagram showing the schematic structure of a transmitting apparatus of the invention. Same reference symbols are given to the same elements as those in the aforementioned diagrams. A description will be given below referring to this diagram.

[0340] A transmitting apparatus 401 has a signal accepting section 402, a sequence output section 403, a spreading section 404 and a signal transmitting section 405. The sequence output section 403 has the pseudorandom sequence output apparatus 101 and controls it.

[0341] The signal accepting section 402 accepts signals to be transferred. A typical transfer signal is a voice signal in case of a portable telephone or PHS. In case of executing digital communication, it is an electrical digital signal. In case of executing optical communication, an optical signal may be converted to an electrical signal which is accepted, and in case where the pseudorandom sequence output apparatus 101 is realized by an optical computer, an optical signal is accepted directly.

[0342] The sequence output section 403 causes the pseudorandom sequence output apparatus 101 equipped therein to accept a sequence initial value and an integer parameter (order) assigned to the transmitting apparatus 401. Because the pseudorandom sequence output apparatus 101 outputs a pseudorandom sequence as mentioned above, the sequence output section 403 outputs this pseudorandom sequence.

[0343] Different values of the sequence initial value and integer parameter (order) can be assigned to different transmitting apparatuses 401 beforehand. While communication terminals which have values, such as a production number, a device number and an acknowledgement number, recorded in a ROM (Read Only Memory), are prevailing, likewise, the sequence initial value and integer parameter (order) can be recorded in the ROM beforehand so that the transmitting apparatus 401 can always use the same sequence initial value and integer parameter (order). Also available is a scheme of recording plural types of sequence initial values and integer parameters (orders) to be used in the ROM and selecting them at random communication by communication.

[0344] In case where such an embodiment is taken, the receiving apparatus that communicates with the transmitting apparatus 401 need to know the sequence initial value and integer parameter (order), recorded in the ROM, somehow, but in case where the transmitting apparatus and the receiving apparatus make a pair, it is possible to take an embodiment such that the same sequence initial value and integer parameter (order) are shared and recorded.

[0345] In case where there are plural types of sequence initial values and integer parameters (orders), which type is used can be checked by correlation detection to be discussed later. A plurality of sequence initial values may be prepared by using chaos random sequences acquired by the asymptotical equation based on a Chebyshev's polynomial. Further, using a scheme of public key encryption, the transmitting apparatus 401 and the receiving apparatus can securely share the sequence initial value and integer parameter (order), as will be discussed later.

[0346] The spreading section 404 performs direct-sequence spectrum spreading by sequentially multiplying the transfer signal accepted by the signal accepting section 402 by the elements of the pseudorandom sequence output from the sequence output section 403. Now, with s(t) being the value of a signal at time t, a scheme of “multiplying the signal s(t) by the elements of a sequence sequentially” will be described.

[0347] In case of using the elements of a sequence with a length N, from that and the chip length w of the direct-sequence spectrum spreading, the period of “multiplying the signal s(t) by the elements of a sequence sequentially” becomes Nw.

[0348] In case of “multiplying the signal s(t) by the elements of a sequence sequentially” from a predetermined time t₀, the signal s(t) is discretized with the chip length w which provides the necessary accuracy. For example, a scheme of acquiring the value of the signal set) for each chip length w, a scheme of acquiring the average of the values of the signal s(t) over the chip length w or the like are feasible. To clarify the description, the description will be given referring to the former scheme.

[0349] While the chip length w should be so set as to be able to sufficiently decode information of the transfer signal on the receiving apparatus side with the required quality, the proper chip length can be selected by a known technique.

[0350] If the proper chip length w is selected, signals with a sufficient quality as seen from the original transfer signal can be acquired by outputting the discrete signal sequence in order over the chip length w.

[0351] The discrete signals can be expressed by the following numerical sequence.

s(t₀), s(t₀+w), s(t₀+2w), s(t₀+3w), s(t₀+4w), . . .

[0352] For an integer i (0≦i), it can be arranged as

s _(i) =s(t ₀ +iw).

[0353] The scheme of obtaining the average of the values of the signal s(t) over the chip length w can arrange it as follows.

s _(i)=(1/w)∫₀ ^(w) s(t ₀ +iu)du.

[0354] Those signal sequences s_(i)(0≦i) are the transfer signal discretized with the required quality.

[0355] Signal sequences spreaded by direct-sequence spectrum spreading with those signal sequences become as follows.

s₀z′[1], s₁z′[2], . . . , s_(M−1)z′[N], s_(N)z′[1], s_(N+1)z′[2], . . .

[0356] That is, for the integer i (0≦i), s_(i)xz′[(i mod N)+1] is the general term of this numerical sequence. Here, x mod y means the remainder of dividing x by y.

[0357] By transmitting the elements of the signal sequence over the period of the chip length, the accepted transfer signal of a predetermined time length can be transmitted over the same time length.

[0358]FIG. 18 shows the behavior of direct-sequence spectrum spreading. A signal 503 to be output from the spreading section 404 is acquired by repeatedly multiplying a transfer signal 501, accepted by the signal accepting section 402, by the elements of a pseudorandom sequence 502 output from the sequence output section 403.

[0359] The signal transmitting section 405 transmits the signal 503, output by the spreading section 404. The transmission is carried out via an antenna in case of a portable telephone or PHS, or via a cable telephone circuit, a cable/wireless LAN circuit or an optical cable in case of a computer communication network.

[0360] (Embodiment of Receiving Apparatus)

[0361] Like the above-described transmitting apparatus, the receiving apparatus of the invention acquires a pseudorandom sequence using the above-described pseudorandom sequence output apparatus and uses the pseudorandom sequence as spreading codes for direct-sequence spectrum despreading. FIG. 19 is an exemplary diagram showing the schematic structure of the receiving apparatus of the invention. The following description will be given referring to this diagram.

[0362] A receiving apparatus 601 has a sequence accepting section 602, a sequence output section 604 and a despreading section 605.

[0363] The sequence accepting section 602 receives signals transmitted by the transmitting apparatus 401. The sequence accepting section 602 is realized by an interface with respect to, for example, an antenna, a telephone circuit, an optical cable circuit or the like.

[0364] The signal that is received by the sequence accepting section 602 contains a signal or noise transmitted by other transmitting apparatuses 401 than that of the communicating party. To eliminate those unnecessary signals, the same pseudorandom sequence as the one used in direct sequence spectrum spreading by the transmitting apparatus 401 of the communicating party is used. The sequence output section 604 outputs this pseudorandom sequence by allowing the pseudorandom sequence output apparatus 101 to accept the sequence initial value and integer parameter (order) used by the transmitting apparatus 401 of the communicating party. Therefore, the embodiment of the sequence output section 604 of the receiving apparatus 601 is similar to the sequence output section 403 of the transmitting apparatus 401.

[0365] To decode the transfer signal that has been accepted by the transmitting apparatus 401 of the communicating party, the signal transmitted by the transmitting apparatus 401 of the communicating party should be multiplied sequentially by the reciprocals of the elements of the pseudorandom sequence to execute direct sequence spectrum despreading.

[0366] With synchronization provided, as the received signal sequences s₀z′[1], s₁z′[2], . . . , S_(M−1)z′[N], s_(N)z′[1], s_(N+1)z′[2], . . . are sequentially multiplied by the reciprocals of the elements of the pseudorandom sequence 1/z′[1], 1/z′[2], . . . , 1/z′[N] in the despreading section 605, signal sequences resulting from decoding of the information of the transfer signal with the required quality,

s₀, s₁, . . . , s_(M−1), s_(N), S_(N+1), . . .

[0367] are acquired. Outputting the signal sequences over the chip length w sequentially can cause the transfer signal to be recovered with the required quality.

[0368] Various schemes, such as correlation detection to be discussed later and a scheme which shares clocks, are feasible for synchronization and those embodiments are also included in the scope of the invention.

[0369] Using the public key encryption scheme by which the transmitting apparatus 401 and the receiving apparatus 601 communicate with each other as will be discussed below, a generating section 611 of the receiving apparatus can generate the same sequence initial value and integer parameter (order) as the transmitting apparatus 401 does.

[0370] First, the receiving apparatus 601 generates a pair of a public key and a private key. Next, the receiving apparatus 601 transmits the public key to the transmitting apparatus 401. The transmitting apparatus 401 encrypts the sequence initial value and integer parameter (order) used by itself with the public key and transmits them to the receiving apparatus 601. The receiving apparatus 601 decodes the transmitted encrypted code with the private key to acquire the sequence initial value and integer parameter (order).

[0371] As such a public key encryption scheme, chaos encryption as disclosed by the present inventor in Japanese Patent Application No. 152063/1999 can be used.

[0372] (Other Embodiments of Spreading/Despreading)

[0373] In addition to the above-described embodiments, the following embodiments can be employed at the time of spreading/despreading. That is, let us consider the case of transferring following information data each taking a value of +1 or −1.

[0374] b₁, b₂, b₃, . . .

[0375] The transmitting apparatus 401 sequentially multiplies the sequence by a pseudorandom sequence as follows.

b₁z′[1], b₁z′[2], . . . , b₁z′[N],

b₂z′[1], b₂z′[2], . . . , b₂z′[N],

b₃z′[1], b₃z′[2], . . . , b₃z′[N], . . .

[0376] The transmitting apparatus 401 transfers the spread signals.

[0377] Suppose that the following are the signals received by the receiving apparatus 601.

s₁, s₂, . . . , s_(N),

s_(N+1), s_(N+2), s_(2N),

s_(2N+1), s_(2N+2), . . . , s_(3N), . . .

[0378] The receiving apparatus 601 multiplies them by a pseudorandom sequence sequentially and takes a sum every N codes. That is, despreading is performed as follows.

e ₁ =s ₁ z′[1]+s ₂ z′[2]+ . . . +s _(N) z′[N],

e ₂ =s _(N+1) z′[1]+s _(N+2) z′[2]+ . . . +s _(2N) z′[N],

e ₃ =s _(2N+1) z′[1]+s _(2N+2) z′[2]+ . . . +s _(3N) z′[N], . . .

[0379] The sequences acquired in this manner are the restored information data.

[0380] In this scheme, data N times the original information data b₁, b₂, b₃, . . . are transmitted from the transmitting apparatus 401. In the receiving apparatus 601, the number of recovered information data e₁, e₂, e₃, . . . becomes 1/N of the number of received data. Given that the chip length of signals to be transmitted and received is w, therefore, the chip length of the original information data and restored information becomes Nw.

[0381] Although the above computation is equivalent to the inner product, as spreading codes are orthogonal to one another, acquiring the inner product can make the amplitude of the transmission signals of other users zero. It is therefore possible to acquire only required signals.

[0382] (Embodiment of Correlation Detection)

[0383] In case where direct sequence spectrum spreading is executed by selecting one of a plurality of pseudorandom sequences in the transmitting apparatus 401, the receiving apparatus 601 can acquire the selected pseudorandom sequence through correlation detection. Further, the correlation detection can ensure synchronization for direct sequence spectrum spreading.

[0384] An embodiment of the receiving apparatus in case of executing correlation detection will be discussed below referring to FIG. 20. In FIG. 20, same reference symbols are given to the same elements as those shown in the aforementioned drawings.

[0385] The receiving apparatus 601 has the generating section 611 and a correlation detection section 612 in addition to the sequence accepting section 602, the sequence output section 604 and the despreading section 605.

[0386] The generating section 611 outputs sets of sequence initial values and integer parameters (orders) selectable by the transmitting apparatus 401. Only one pseudorandom sequence may be output. In this case, as it is not necessary to select any single set from the sets of sequence initial values and integer parameters (orders), the correlation detection section 612 serves to provide synchronization of signals.

[0387] The sequence output section 604 outputs pseudorandom sequences, which can be selected by the transmitting apparatus 401, in accordance with the sequence initial value and integer parameter (order) generated by the generating section 611.

[0388] The correlation detection section 612 attempts correlation detection for each of the pseudorandom sequences output from the sequence output section 604. The correlation detection is carried out by sequentially multiplying the received signal by the “elements” of the pseudorandom sequence to be checked. A known scheme can be used for the correlation detection scheme.

[0389] As the pseudorandom sequences to be used in this embodiment are excellent in correlation characteristic, the strength of signals after multiplication becomes extremely weak in case where different pseudorandom sequences are selected in the receiving apparatus 601, so that correlation detection would fail.

[0390] In case where correlation detection is executed with the same pseudorandom sequence of the transmitting apparatus 401 selected, on the other hand, the strength of signals after multiplication exceeds a predetermined value. Further, signal synchronization can be taken by shifting an offset of the pseudorandom sequence in such a way as to be synchronized with the received signal.

[0391] The despreading section 605 decodes the transfer signal by sequentially multiplying the signal, received by the sequence accepting section 602, by the “reciprocals of the elements” of the pseudorandom sequence which has been selected by the correlation detection section 612 and synchronized with the received signal.

[0392] The correlation detection section 612 sequentially multiplies the received signal by the “elements” of the pseudorandom sequence, whereas the despreading section 605 sequentially multiplies the received signal by the “reciprocals of the elements” of the pseudorandom sequence. The former computes autocorrelation and cross-correlation, whereas the latter performs decoding.

[0393] (Communication System)

[0394] The communication system according to the embodiment can be comprised of the transmitting apparatus 401 and the receiving apparatus 601 that receives a signal transmitted by the transmitting apparatus and decodes the transfer signal. If the pseudorandom sequence to be used differs between the transmitting apparatus 401 and receiving apparatus 601, decoding of the transfer signal would fail.

[0395] Even if a plurality of transmitting apparatuses 401 are communicating with a plurality of receiving apparatuses 601 over the same frequency band, it is possible to keep security and ensure mutual communications while guaranteeing the quality according to the number of pairs of communicators who are using them.

[0396] Because the pseudorandom sequences to be generated in this embodiment can significantly increase the types of codes as compared with the conventional pseudorandom sequences, particularly, they are suitable for CDMA type communications which potentially include many users.

[0397] (Receiving Apparatus Which Receives Asynchronously Transmitted Signals)

[0398] As signals are transmitted asynchronously from a mobile terminal to a base station in mobile communication, communication between both is initiated. The following will discuss an embodiment where the invention is adapted to the receiving apparatus of such a base station. FIG. 21 is an exemplary diagram showing the schematic structure of the receiving apparatus of the embodiment.

[0399] A receiving apparatus 2101 receives a signal via an antenna 2102. The received signal is subjected to a process of converting an RF frequency band to a base band frequency band by a band-pass filter (BPF) 2103 and is then sent to a reception-side filter 2104.

[0400] Meanwhile, a code generating section 2111 generates codes included in an orthogonal code sequence. The orthogonal code sequences include the following, for example.

[0401] M-sequence

[0402] Gold-codes

[0403] orthogonal code sequence acquired from a Walsh function (Walsh-Hadamard sequence)

[0404] orthogonal code sequence acquired from a Chebyshev's polynomial

[0405] Baker sequence

[0406] Manchester-coded orthogonal sequence

[0407] Further, in the CDMA communication technology, signal processing for spreading/despreading is executed using complex spreading codes. In this case, therefore, a complex number whose real portion and imaginary portion are assigned with codes included in those orthogonal code sequences is generated as a code.

[0408] The generated code is sent to a code-side filter section 2112.

[0409] While the FIR (Finit Impulse Response) filters 201 shown in the aforementioned FIG. 3 which have the same parameters D, x, r, N are used for the reception-side filter 2104 and the code-side filter section 2112, it is desirable to set r=2-3^(1/2).

[0410] The correlation of the signal that has been processed by the reception-side filter 2104 and the code-side filter section 2112 is detected by the correlation detection section 2108. The correlation between complex numbers is acquired by conjugating either one of the complex numbers and calculating the product of it and the other complex number.

[0411] Then, a transfer signal is acquired by adequately performing despreading or the like of the result of the correlation detection with the spreading codes of the mobile station and despreading codes of the base station taken as the same.

[0412] As signals are transmitted asynchronously from a mobile terminal to a base station in mobile communication, communication between them is started. Therefore, this correlation detection becomes extremely important in reduction of the BER. In case of communication from the base station to a mobile station (Down Link Communication), on the other hand, synchronization has been taken beforehand so that this technique is not essential.

[0413] The embodiment has such a feature that while the embodiment, if used on the base station side (reception side) alone, is sufficient to improve the BER, mobile terminals which have already been prevailing and used can be kept utilized.

[0414]FIG. 22 is a graph of simulation results showing the relationship between the number of users and the BER in a W-CDMA system in case where the present technique is adapted and the conventional W-CDMA system. The following description will be given referring to this diagram.

[0415] In FIG. 22, the horizontal axis is the number of users and the vertical axis is the BER, showing the results in the case where this technique is adapted (LSF(BS) in the diagram) and the case of the prior art (W/O LSF in the diagram).

[0416] In case where the number of users is 20, for example, the BER is about 0.005 in the prior art whereas the BER is about 0.003 according to the present technique, showing a considerable improvement on the BER. With the same BER, merely performing the filter process of this technique on the base station side can increase the number of users by about 10 to 20 percent as compared with the prior art.

[0417] In particular, as the facility cost of the base station for W-CDMA which has the same user capacity can be reduced by about 10 to 20 percent by merely using the simple FIR filter of the invention, this embodiment is considerably effective at the time of promoting the W-CDMA system.

[0418] (Complex Filter)

[0419]FIG. 23 is an exemplary diagram showing a preferable embodiment of a complex filter, particularly, the schematic structure of a complex filter suitable for a mobile telephone or the like of the W-CDMA standard.

[0420] A filter apparatus 3101 according to this embodiment performs a filter process on complex number sequences using a predetermined impulse constant r and a predetermined delay time constant D, and has an input accepting section 3102, a real processing section 3103, an imaginary processing section 3104 and an output section 3105.

[0421] First, the input accepting section 3102 accepts inputting of a complex number sequence.

[0422] Next, the real processing section 3103 accepts, as an input, a real portion sequence in the complex number sequence whose input has been accepted by the input accepting section 3102, and outputs a filtered sequence.

[0423] Meanwhile, the imaginary processing section 3104 accepts, as an input, an imaginary portion sequence in the complex number sequence whose input has been accepted by the input accepting section 3102, and outputs a filtered sequence.

[0424] The processes that are performed in the real processing section 3103 and the imaginary processing section 3104 can be executed in parallel.

[0425] And, the output section 3105 outputs a complex number sequence whose real portion is the sequence output from the real processing section 3103 and whose imaginary portion is the sequence output from the imaginary processing section 3104.

[0426] Here, the real processing section 3103 and the imaginary processing section 3104 output a plurality of sequences having input sequences delayed, amplify the plural sequences, and output the sums of the amplified sequences, the delay times of the plural sequences form an arithmetical progression of a common difference D, and amplification factors respectively corresponding to them form a geometrical progression of a common ratio −r or common ratio −1/r.

[0427] Here, the real processing section 103 and the imaginary processing section 104 are the FIR (Finite Impulse Response) filters 201 shown in FIG. 3 and use the same parameters D, r, x, N. The real portion and imaginary portion of a complex number sequence are filtered by using those two FIR filters 201 respectively.

[0428] (Spread-Modulation Apparatus)

[0429]FIG. 24 is an exemplary diagram showing the schematic structure of a spread-modulation apparatus which performs a despread-modulation process for W-CDMA using the complex filter apparatus 3101.

[0430] A spread modulation apparatus 3301 has a scramble section 3302 and a modulation section 3303.

[0431] The scramble section 3302 outputs a complex number resulting from scrambling the real portion and imaginary portion of an input digital complex number with a predetermined spreading code of a chip rate 1/D.

[0432] Because the embodiment is for W-CDMA, scrambling which conforms to the IMT-2000 W-CDMA system standard is adapted, but in case of using another wireless communications system (CDMA 2000 system standard, Wireless LAN IEEE 802.11b standard or the like), scrambling which conforms to that system should be executed.

[0433]FIG. 23 shows an example in which such a real portion and imaginary portion are scrambled together. In the embodiment in FIG. 23, scrambling is performed using a Gold-code with a length of 2²⁵-1 as a scrambling code. This Gold-code is generated by obtaining an exclusive logical sum for each bit of two types of M-sequences generated from a generation polynomial of the 25-th degree over finite fields GF(2).

[0434] As disclosed in H. Holma and A. Toskala, “W-CDMA for UTMS” (John Wiley and Son, 2001) or 3rd Generation Partnership Project (3GPP); Technical Specification Group Radio Access Network; Spreading and Module (FDD) (3GTS 25.213), a scrambling code is generated at 3.84 M chips/sec according to the W-CDMA standard.

[0435] Information of scrambled plural bits is converted to ‘bit sequence’ or “sequences of ‘bit sequence’” by a sine mapper (SM) and they are given to the filter apparatus 3101 in the modulation section 3303 as an input of a complex number sequence. The output of the filter apparatus 3101 in the modulation section 3303 becomes the output of the spread modulation apparatus 3301.

[0436] For the spreading code, the scramble section can be constructed so as to scramble any one of a Gold-code, a Baker sequence and a Walsh-Hadamard orthogonal code as a spreading code.

[0437] In addition, the spreading code or the spreading code of the scramble section may be given at individual points on the orbit of a map dynamical system having ergodicity. As the map dynamical system having ergodicity, there is a map of a Chebyshev's polynomial F_(a)(·) of the a-th order equal to or higher than the second order.

[0438] Meanwhile, the modulation section 3303 gives the complex number output from the scramble section 3302 to the filter apparatus 3101 as an input and spread-modulates it. As mentioned above, the chip length of an input digital signal and the parameter of the delay time of the FIR filter 201 used by the modulation section 3303 are both equal to a predetermined delay time D.

[0439] (Experimental Results)

[0440] The following will describe the results of experiments conducted on the characteristics of the filter apparatus 3101 used in the embodiment and the characteristics of transferred signals.

[0441]FIG. 25 is a graph showing the frequency characteristic of the filter apparatus 3101 (the horizontal axis is a frequency of 0 MHz to 5 MHz and the vertical axis is the magnitude of −90 db to 10 db). FIG. 26 is a graph showing the spectrum distribution of signals transmitted by the spread modulation apparatus 301 (the horizontal axis is a frequency of 0 MHz to 0.5 MHz and the vertical axis is the magnitude of −120 db to 10 db).

[0442] As shown in FIG. 25, the frequency spectrum of the filter apparatus 3101 has a magnitude of −2 db to 2 db with respect to the frequency of 0 MHz to 5 MHz. As shown in FIG. 26, the magnitude of the frequency spectrum after has a shape of the foot of a mountain and is low with respect to the frequencies of 0 to 0.1 MHz and 0.4 to 0.5 Hz, but shows a spectrum shape with a flat magnitude in a range of 0.15 Hz to 0.35 Hz.

[0443] From those it is apparent that the frequency characteristic of the filter apparatus 3101 is the same as a filter which passes all the frequency bands (all pass filter) and the filter apparatus 3101 does not influence the spectrum distribution of a signal to be transferred.

[0444] With the transfer rate of 60 kbps, 15 users and the WWGN channel E₀/N₀ being 10 db, the W-CDMA system was constructed and simulation tests were conducted. Then, the bit error rate was 0.0012 according to the prior art scheme, whereas it was 0.00075 according to the embodiment. Therefore, the bit error rate is reduced by about 60 percent, which shows the effectiveness of this embodiment.

[0445] In case where the embodiment is adapted to wireless communication, therefore, even if a plurality of transmitting apparatuses are communicating with a plurality of receiving apparatuses over the same frequency band, it is possible to keep security and ensure mutual communications while guaranteeing the quality according to the number of communicators who are using them.

INDUSTRIAL APPLICABILITY

[0446] As described above, the present invention can provide a filter apparatus, a receiving apparatus, a transmitting apparatus, a pseudorandom sequence output apparatus, a filter method, a receiving method and a transmitting method, a pseudorandom sequence output method, which are suitable in various usages, and a program which realizes them on a computer.

[0447] The invention is based on Japanese Patent Application No. 2001-087480 filed on Mar. 26, 2001, Japanese Patent Application No. 2001-306794 filed on Oct. 2, 2001 and Japanese Patent Application No. 2002-045255 filed on Feb. 21, 2002, and includes the specifications, claims, drawings and abstracts of those applications. The present specification incorporates what is disclosed in the applications entirely by reference. 

1. A filter apparatus (201) for a predetermined real impulse constant r (−1<r<1), a predetermined real number constant x (x≠0), a predetermined delay time constant D and a predetermined positive integer M (M>1), characterized by having: an input terminal which accepts inputting of an input signal; a delay amplification section which outputs M signals that are said input-accepted input signal delay-amplified with a delay time to and an amplification factor a₀, with a delay time t₁ and an amplification factor a₁, . . . , and with a delay time t_(M−1) and an amplification factor a_(M−1), respectively; an adding section (204) which outputs a sum of the delay-amplified and output M signals; and an output terminal which outputs the added and output signal, and characterized in that t₀, t₁, . . . , t_(M−1) is an arithmetical progression of a common difference D, and a₀, a₁, . . . , a_(M−1) is a geometrical progression of a common ratio −r or −1/r.
 2. The filter apparatus (201) as recited in claim 1, characterized in that said delay amplification section has: a delay section (202) which outputs M signals s₀, s₁, . . . , s_(M−1) that are said input-accepted input signal delayed with delay times t₀, t₁, . . . , t_(M−1), respectively; and an amplification section (203) which outputs M signals that are said delayed and output M signals s₀, s₁, . . . , s_(M−1) amplified with amplification factors a₀, a₁, . . . , a_(M−1), respectively.
 3. The filter apparatus (201) as recited in claim 1, characterized in that said predetermined real impulse constant r is equal to 2-3^(1/2) in a notation of a fixed point computation with a predetermined accuracy.
 4. The filter apparatus (201) as recited in claim 1, characterized in that said predetermined real impulse constant r satisfies 2-3^(1/2)−0.1≦r≦2-3^(1/2)+0.1.
 5. A receiving apparatus (2101) characterized by having: a signal receiving section (2102) which receives signals; a reception-side filter section (2104) which accepts said received signals as an input sequence and filters and outputs it; a code generating section (2111) which generates spreading codes; a code-side filter section (2112) which accepts said generated spreading codes as an input sequence and filters and outputs it; and a correlation detection section (2108) which performs correlation detection on a result of filtering in said reception-side filter section with respect to a result of filtering in said code-side filter section, characterized in that each of said reception-side filter section (2104) and said correlation detection section (2108) is the filter apparatus (201) as recited in claim 1 with respect to a predetermined real impulse constant r, a predetermined real number constant x, a predetermined delay time constant D and a predetermined positive integer N.
 6. The receiving apparatus (2101) as recited in claim 5, characterized in that said code generating section generates, as spreading codes, an orthogonal code sequence (including an M-sequence, Gold-codes, an orthogonal code sequence acquired from a Walsh function, an orthogonal code sequence acquired from a Chebyshev's polynomial, a Baker sequence and a Manchester-coded orthogonal sequence; the same applied hereinafter), or a complex orthogonal code sequence in which a real portion and an imaginary portion are respectively composed of different orthogonal code sequences.
 7. The filter apparatus (2101) as recited in claim 1, characterized in that said input terminal accepts a sequence of complex numbers as an input signal, and said output terminal outputs a sequence of complex numbers as an output signal.
 8. A complex filter apparatus which filters a sequence of complex numbers, characterized by having: a complex input section which accepts inputting of a sequence of complex numbers; a real filter section which filters a sequence of real portions in the sequence of complex numbers inputting of which has been accepted by said complex input section; an imaginary filter section which filters a sequence of imaginary portions in the sequence of complex numbers inputting of which has been accepted by said complex input section; and a complex output section which outputs a sequence of complex numbers whose real portions are the sequence output by said real filter section and whose imaginary portions are the sequence output by said imaginary filter section, and characterized in that each of said real filter section and said imaginary filter section is the filter apparatus as recited in claim 1 with respect to a predetermined real impulse constant r, a predetermined real number constant x, a predetermined delay time constant D and a predetermined positive integer M.
 9. A spread modulation apparatus using the complex filter apparatus as recited in claim 8, characterized by having: a scramble section which outputs a complex number that is a real portion and imaginary portion of an input digital complex number scrambled with a predetermined spreading code of a chip rate 1/D; and a modulation section which spread-modulates the complex number output from said scramble section by giving it to said complex filter apparatus as an input.
 10. The spread modulation apparatus as recited in claim 9, characterized in that scrambling by said scramble section conforms to the IMT-2000 W-CDMA system standard, CDMA 2000 system standard or Wireless LAN IEEE 802.11b standard.
 11. The spread modulation apparatus as recited in claim 10, characterized in that said scramble section performs scrambling using one of a Gold-code, a Baker sequence and a Walsh-Hadamard code as a spreading code.
 12. The spread modulation apparatus as recited in claim 11, characterized in that the spreading code of said scramble section is given by individual points on an orbit of a map dynamical system having ergodicity.
 13. The spread modulation apparatus as recited in claim 12, characterized in that the dynamical system having ergodicity in said scramble section is a map dynamical system having a Chebyshev's polynomial of a secondary order or higher as a map.
 14. An output apparatus (101) which outputs a pseudorandom sequence of a length L (L≧1) with respect to a predetermined real impulse constant r (−1<r<1) and a predetermined real number constant C (C≠0), characterized by having: a sequence accepting section (102) which accepts inputting of spreading codes (z[1], z[2], . . . , z[L]) of a length N (N≧1) as a sequence initial value; a calculation section (103) which calculates, from said input-accepted (z[1], z[2], . . . , z[L]), (z′[1]), z′[2], . . . , z′[N]) that satisfy z′[1]=CΣ _(j=1) ^(M)(−r)^(M+1−j) z[j]; z′[2]=CΣ _(j=1) ^(M)(−r)^(M+1−j) z[j+1]; z′[N]=CΣ _(j=1) ^(M)(−r)^(M+1−j) z[J+N−1] with respect to a predetermined positive integer M (1≦M≦N, M+N<L); and a random number output section (104) which outputs said (z′[1], z′[2], . . . , z′[N]) as a pseudorandom sequence.
 15. The output apparatus (101) as recited in claim 14, characterized in that said spreading codes of the length L are an orthogonal code sequence (including an M-sequence, Gold-codes, an orthogonal code sequence acquired from a Walsh function, an orthogonal code sequence acquired from a Chebyshev's polynomial, a Baker sequence and a Manchester-coded orthogonal sequence).
 16. The output apparatus (101) as recited in claim 14, characterized in that said predetermined real impulse constant r is equal to 2-3^(1/2) in a notation of a fixed-point computation with a predetermined accuracy.
 17. The output apparatus (101) as recited in claim 14, characterized in that said predetermined real impulse constant r satisfies 2-3^(1/2)−0.1≦r≦2-3^(1/2)+0.1.
 18. A transmitting apparatus (401) characterized by having: a signal accepting section (402) which accepts inputting of a transfer signal; the output apparatus (101) as recited in claim 14, which outputs a pseudorandom sequence of a length N; a spreading section (404) which spectrum-spreads said input-accepted transfer signal with said output pseudorandom sequence of the length N as spreading codes; and a signal transmitting section (405) which transmits a signal of a result of the spectrum spreading.
 19. The transmitting apparatus as recited in claim 18, characterized by further having: a selecting section which selects spreading codes P=(z[1], z[2], . . . , z[L]); and a parameter transmitting section which transmits said selected spreading codes P=(z[1], z[2], . . . , z[L]), and characterized in that said output apparatus accepts said selected spreading codes P=(z[1], z[2], . . . , z[L]) as a sequence initial value.
 20. The transmitting apparatus as recited in claim 18, characterized by further having: a parameter receiving section which receives spreading codes Q=(z[1], z[2], . . . , z[L]), and characterized in that said output apparatus accepts said received spreading codes Q=(z[1], z[2], . . . , z[L]) as a sequence initial value.
 21. A receiving apparatus characterized by having: a signal receiving section which receives a signal; the output apparatus as recited in claim 14, which outputs a pseudorandom sequence of a length N; a despreading section which spectrum-despreads said received signal with said output pseudorandom sequence of the length N as spreading codes; and a signal output section which outputs a signal of a result of the spectrum despreading as a transfer signal.
 22. The receiving apparatus as recited in claim 21, characterized by further having: a selecting section which selects spreading codes Q=(z[1], z[2], . . . , z[L]); and a parameter transmitting section which transmits said selected spreading codes Q=(z[1], z[2], . . . , z[L]), and characterized in that said output apparatus accepts said selected spreading codes Q=(z[1], z[2], . . . , z[L]) as a sequence initial value.
 23. The receiving apparatus as recited in claim 21, characterized by further having: a parameter receiving section which receives spreading codes P=(z[1], z[2], . . . , z[L]), and characterized in that said output apparatus accepts said received spreading codes P=(z[1], z[2], . . . , z[L]) as a sequence initial value.
 24. A filter method for a predetermined real impulse constant r (−1<r<1), a predetermined real number constant x (x≠0), a predetermined delay time constant D and a predetermined positive integer M (M>1), characterized by having: an input step which accepts inputting of an input signal; a delay amplification step which outputs M signals that are said input-accepted input signal delay-amplified with a delay time to and an amplification factor a₀, with a delay time t₁ and an amplification factor a₁, . . . , and with a delay time t_(M−1) and an amplification factor a_(M−1), respectively; an adding step which outputs a sum of the delay-amplified and output M signals; and an output step which outputs the added and output signal, and characterized in that t₀, t₁, . . . , t_(M−1) is an arithmetical progression of a common difference D, and a₀, a₁, . . . , a_(M−1) is a geometrical progression of a common ratio −r or −1/r.
 25. The filter method as recited in claim 24, characterized in that said delay amplification step has: a delay step which outputs M signals s₀, s₁, . . . , S_(M−1) that are said input-accepted input signal delayed with delay times t₀, t₁, . . . , t_(M−1), respectively; and an amplification step which outputs M signals that are sald delayed and output M signals s₀, s₁, . . . , s_(M−1) amplified with amplification factors a₀, a₁, . . . , a_(M−1), respectively.
 26. The filter method as recited in claim 24, characterized in that said predetermined real impulse constant r is equal to 2-3^(1/2) in a notation of a fixed-point computation with a predetermined accuracy.
 27. The filter method as recited in claim 24, characterized in that said predetermined real impulse constant r satisfies 2-3^(1/2)−0.1≦r≦2-3^(1/2)+0.1.
 28. A receiving method characterized by having: a signal receiving step which receives signals; a reception-side filter step which accepts said received signals as an input sequence and filters and outputs it; a code generating step which generates spreading codes; a code-side filter step which accepts said generated spreading codes as an input sequence and filters and outputs it; and a correlation detection step which performs correlation detection on a result of filtering in said reception-side filter step with respect to a result of filtering in said code-side filter step, characterized in that each of said reception-side filter step and said correlation detection step performs a filtering process by the filter method as recited in claim 24 with respect to a predetermined real impulse constant r, a predetermined real number constant x, a predetermined delay time constant D and a predetermined positive integer N.
 29. The receiving method as recited in claim 28, characterized in that said code generating step generates, as spreading codes, an orthogonal code sequence (including an M-sequence, Gold-codes, an orthogonal code sequence acquired from a Walsh function, an orthogonal code sequence acquired from a Chebyshev's polynomial, a Baker sequence and a Manchester-coded orthogonal sequence; the same applied hereinafter), or a complex orthogonal code sequence in which a real portion and an imaginary portion are respectively composed of different orthogonal code sequences.
 30. The filter method as recited in claim 24, characterized in that a sequence of complex numbers is accepted as an input signal in said input step, and a sequence of complex numbers is output as an output signal in said output step.
 31. A complex filter method which filters a sequence of complex numbers, characterized by having: a complex input step which accepts inputting of a sequence of complex numbers; a real filter step which filters a sequence of real portions in the sequence of complex numbers inputting of which has been accepted in said complex input step; an imaginary filter step which filters a sequence of imaginary portions in the sequence of complex numbers inputting of which has been accepted in said complex input step; and a complex output step which outputs a sequence of complex numbers whose real portions are the sequence output by said real filter step and whose imaginary portions are the sequence output in said imaginary filter step, and characterized in that each of said real filter step and said imaginary filter step performs a filtering process by the filter method as recited in claim 24 with respect to a predetermined real impulse constant r, a predetermined real number constant x, a predetermined delay time constant D and a predetermined positive integer M.
 32. A spread modulation method using the complex filter method as recited in claim 31, characterized by having: a scramble step which outputs a complex number that is a real portion and imaginary portion of an input digital complex number scrambled with a predetermined spreading code of a chip rate 1/D; and a modulation step which spread-modulates the complex number output in said scramble step by giving it to said complex filter method as an input.
 33. The spread modulation method as recited in claim 32, characterized in that scrambling by said scramble step conforms to the IMT-2000 W-CDMA system standard, CDMA 2000 system standard or Wireless LAN IEEE 802.11b standard.
 34. The spread modulation method as recited in claim 33, characterized in that said scramble step performs scrambling using one of a Gold-code, a Baker sequence and a Walsh-Hadamard code as a spreading code.
 35. The spread modulation method as recited in claim 34, characterized in that the spreading code of said scramble step is given by individual points on an orbit of a map dynamical system having ergodicity.
 36. The spread modulation method as recited in claim 35, characterized in that the dynamical system having ergodicity in said scramble step is a map dynamical system having a Chebyshev's polynomial of a secondary order or higher as a map.
 37. An output method which outputs a pseudorandom sequence of a length N (N>1) with respect to a predetermined real impulse constant r (−1<r<1) and a predetermined real number constant C (C≠0), characterized by having: a sequence accepting step which accepts inputting of spreading codes (z[1], z[2], . . . , z[L]) of a length L (L≧1) as a sequence initial value; a calculation step which calculates, from said input-accepted (z[1], z[2], . . . , z[L]), (z′[1], z′[2], . . . , z′[N]) that satisfy z′[1]=CΣ _(j)=1^(M)(−r)^(M+1−j) z[j]; z′[2]=CΣ _(j)=1^(M)(−r)^(M+1−j) z[j+1]; z′[N]=CΣ _(j=)1^(M)(−r)^(M+1−j) z[j+N−1] with respect to a predetermined positive integer M (1≦M≦N, M+N<L); and a random number output step which outputs said (z′[1], z′[2], . . . , z′[N]) as a pseudorandom sequence.
 38. The output method as recited in claim 37, characterized in that said spreading codes of the length L are an orthogonal code sequence (including an M-sequence, Gold-codes, an orthogonal code sequence acquired from a Walsh function, an orthogonal code sequence acquired from a Chebyshev's polynomial, a Baker sequence and a Manchester-coded orthogonal sequence).
 39. The output method as recited in claim 37, characterized in that said predetermined real impulse constant r is equal to 2-3^(1/2) in a notation of a fixed-point computation with a predetermined accuracy.
 40. The output method as recited in claim 37, characterized in that said predetermined real impulse constant r satisfies 2-3^(1/2)−0.1≦r≦2-3^(1/2)+0.1.
 41. A transmitting method characterized by having: a signal accepting step which accepts inputting of a transfer signal; a random number output step which outputs a pseudorandom sequence by the output method as recited in claim 37, which outputs a pseudorandom sequence of a length N; a spreading step which spectrum-spreads said input-accepted transfer signal with said output pseudorandom sequence of the length N as spreading codes; and a signal transmitting step which transmits a signal of a result of the spectrum spreading.
 42. The transmitting method as recited in claim 41, characterized by further having: a selecting step which selects spreading codes P=(z[1], z[2], . . . , z[L]); and a parameter transmitting step which transmits said selected spreading codes P=(z[1], z[2], . . . , z[L]), and characterized in that said random number output step accepts said selected spreading codes P=(z[1], z[2], . . . , z[L]) as a sequence initial value.
 43. The transmitting method as recited in claim 41, characterized.by further having: a parameter receiving step which receives spreading codes Q=(z[1], z[2], . . . , z[L]), and characterized in that said random number output step accepts said received spreading codes Q=(z[1], z[2], . . . , z[L]) as a sequence initial value.
 44. A receiving method characterized by having: a signal receiving step which receives a signal; a random number output step which outputs a pseudorandom sequence by the output method as recited in claim 37, which outputs a pseudorandom sequence of a length N; a despreading step which spectrum-despreads said received signal with said output pseudorandom sequence of the length N as spreading codes; and a signal output step which outputs a signal of a result of the spectrum despreading as a transfer signal.
 45. The receiving method as recited in claim 44, characterized by further having: a selecting step which selects spreading codes Q=(z[1], z[2], . . . , z[L]); and a parameter transmitting step which transmits said selected spreading codes Q=(z[1], z[2], . . . , z[L]), and characterized in that said random number output step accepts said selected spreading codes Q=(z[1], z[2], . . . , z[L]) as a sequence initial value.
 46. The receiving method as recited in claim 44, characterized by further having: a parameter receiving step which receives spreading codes P=(z[1], z[2], . . . , z[L]), and characterized in that said random number output step accepts said received spreading codes P=(z[1], z[2], . . . , z[L]) as a sequence initial value.
 47. A program characterized by allowing a computer to function, with respect to a predetermined real impulse constant r (−1<r<1), a predetermined real number constant x (x≠0), a predetermined delay time constant D and a predetermined positive integer M (M>1), as: an input section which accepts inputting of an input is signal; a delay amplification section which outputs M signals that are said input-accepted input signal delay-amplified with a delay time to and an amplification factor a₀, with a delay time t₁ and an amplification factor a₁, . . . , and with a delay time t_(M−1) and an amplification factor a_(M−1), respectively; an adding section which outputs a sum of the delay-amplified and output M signals; and an output section which outputs the added and output signal, and characterized by allowing the computer to function in such a way that t₀, t₁, t_(M−1) is an arithmetical progression of a common difference D, and a₀, a₁, . . . , a_(M−1) is a geometrical progression of a common ratio −r or −1/r.
 48. The program as recited in claim 47, characterized in that instead of said delay amplification section, said computer is functioned as: a delay section which outputs M signals s₀, s₁, . . . , s_(M−1) that are said input-accepted input signal delayed with delay times t₀, t₁, . . . , t_(M−1), respectively; and an amplification section which outputs M signals that are said delayed and output M signals s₀, s₁, . . . , s_(M−1) amplified with amplification factors a₀, a₁, . . . , a_(M−1), respectively.
 49. The program as recited in claim 47, characterized in that said predetermined real impulse constant r is equal to 2-3^(1/2) in a notation of a fixed-point computation with a predetermined accuracy.
 50. A program which allows a computer to output a pseudorandom sequence of a length N (N≧2) with respect to a predetermined real impulse constant r (−1<r<1) and a predetermined real number constant C (C≠0), characterized by allowing said computer to function as: a sequence accepting section which accepts inputting of spreading codes (z[1], z[2], . . . , z[L]) of a length L (L≧1) as a sequence initial value; a calculation section which calculates, from said input-accepted (z[1], z[2], . . . , z[L]), (z′[1], z′[2], . . . , z′[N]) that satisfy z′[1]=CΣ _(j)=1^(M)(−r)^(M+1−j) z[j]; z′[2]=CΣ _(j)=1^(M)(−r)^(M+1−j) z[j+1]; z′[N]=CΣ _(j)=1^(M)(−r)^(M+1−j) z[j+N−1] with respect to a predetermined positive integer M (1≦M≦N, M+N<L); and a random number output section which outputs said (z′[1], z′[2], . . . , z′[N]) as a pseudorandom sequence.
 51. The program as recited in claim 50, characterized in that in said computer, said spreading codes of the length L are functioned as an orthogonal code sequence (including an M-sequence, Gold-codes, an orthogonal code sequence acquired from a Walsh function, an orthogonal code sequence acquired from a Chebyshev's polynomial, a Baker sequence and a Manchester-coded orthogonal sequence).
 52. The program as recited in claim 50, characterized in that said predetermined real impulse constant r is equal to 2-3^(1/2) in a notation of a fixed-point computation with a predetermined accuracy. 